Bounding the size of the median graph

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4478 LNCS, Issue PART 2, 2007, Pages 491-498

  Ferrer, Miquel ^a   Valveny, Ernest ^a   Serratosa, Francesc ^b  

^a UNIVERSITAT AUTÒNOMA DE BARCELONA   (Spain)

^b UNIVERSITAT ROVIRA I VIRGILI   (Spain)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDARY CONDITIONS; IMAGE SEGMENTATION; INFORMATION THEORY; LEARNING ALGORITHMS;

SUPERGRAPHS;

GRAPH THEORY;

EID: 38049113325     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72849-8_62     Document Type: Conference Paper

References (7)

1. Jiang, X., Münger, A., Bunke, H.: On median graphs: Properties, algorithms, and applications. IEEE Trans. Pattern Anal. Mach. Intell. 23(10), 1144-1151 (2001)
2. Bunke, H., Münger, A., Jiang, X.: Combinatorial search versus genetic algorithms: A case study based on the generalized median graph problem. Pattern Recognition Letters 20(11-13), 1271-1277 (1999)
3. Jiang, X., Münger, A., Bunke, H.: Synthesis of representative graphical symbols by computing generalized median graph. In: Chhabra, A.K., Dori, D. (eds.) GREC 1999. LNCS, vol. 1941, pp. 183-192. Springer, Heidelberg (2000)
4. Hlaoui, A., Wang, S.: A new median graph algorithm. In: Hancock, E.R., Vento, M. (eds.) GbRPR 2003. LNCS, vol. 2726, pp. 225-234. Springer, Heidelberg (2003)
5. Ferrer, M., Serratosa, F., Sanfeliu, A.: Synthesis of median spectral graph. In: Marques, J.S., de la Blanca, N.P., Pina, P. (eds.) IbPRIA 2005. LNCS, vol. 3523, pp. 139-146. Springer, Heidelberg (2005)
6. Bunke, H., Allerman, G.: Inexact graph matching for structural pattern recognition. Pattern Recognition Letters 1(4), 245-253 (1983)
7. Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recognition Letters 18(8), 689-694 (1997)