Efficient algorithms on trees and graphs with unique node labels

Studies in Computational Intelligence

Volumn 52, Issue , 2007, Pages 137-149

  Valiente, Gabriel ^a  

^a NONE

Author keywords

Edit distance; Edit script; Efficient algorithms; Graph isomorphism; Graph matching; Graphs with unique node labels; Largest common subgraph; Smallest common supergraph; Subgraph isomorphism; Trees

Indexed keywords

EID: 34147221117     PISSN: 1860949X     EISSN: None     Source Type: Book Series    
DOI: 10.1007/978-3-540-68020-8_5     Document Type: Article

References (30)

1. Gati, G.: Further annotated bibliography on the isomorphism disease. J. Graph Theory 3(1) (1979) 95-109
2. Read, R.C., Corneil, D.G.: The graph isomorphism disease. J. Graph Theory 1(4) (1977) 339-363
3. Dickinson, P.J., Bunke, H., Dadej, A., Kraetzl, M.: On graphs with unique node labels. In Hancock, E.R., Vento, M., eds.: Proceedings of Fourth IAPR International Workshop on Graph Based Representations in Pattern Recognition. Volume 2726 of Lecture Notes in Computer Science. Berlin Heidelberg New York, Springer (2003) 13-23
4. Dickinson, P.J., Bunke, H., Dadej, A., Kraetzl, M.: Matching graphs with unique node labels. Pattern Anal. Appl. 7(3) (2004) 243-254
5. Schenker, A., Bunke, H., Last, M., Kandel, A.: Polynomial time complexity graph distance computation for web content mining. In Basu, M., Ho, T.K., eds.: Data Complexity in Pattern Recognition. Berlin Heidelberg New York, Springer (2006)
6. Conte, D., Foggia, P., Sansone, C., Vento, M.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. 18(3) (2004) 265-298
7. Jiang, X.Y., Bunke, H.: Including geometry in graph representations: A quadratic-time graph isomorphism algorithm and its applications. In: Proceedings of Sixth International Workshop on Structural and Syntactical Pattern Recognition. Volume 1121 of Lecture Notes in Computer Science. Berlin Heidelberg New York, Springer (1996) 110-119
8. Jiang, X.Y., Bunke, H.: Optimal quadratic-time isomorphism of ordered graphs. Pattern Recogn. 32(7) (1999) 1273-1283
9. Messmer, B.T., Bunke, H.: Error-correcting graph isomorphism using decision trees. Int. J. Pattern Recogn. 12(6) (1998) 721-742
10. Messmer, B.T., Bunke, H.: A decision tree approach to graph and subgraph isomorphism detection. Pattern Recogn. 32(12) (1999) 1979-1998
11. Jiang, X.Y., Bunke, H.: Marked subgraph isomorphism of ordered graphs. In: Proceedings of Joint IAPR International Workshops on Structural and Syntactical Pattern Recognition and Structural Pattern Recognition. Volume 1451 of Lecture Notes in Computer Science. Berlin Heidelberg New York, Springer (1998) 122-131
12. Wong, A.K.C., You, M., Chan, S.C.: An algorithm for graph optimal monomorphism. IEEE Trans. Syst. Man Cybern. 20(3) (1990) 628-636
13. Wong, E.K.: Model matching in robot vision by subgraph isomorphism. Pattern Recogn. 25(3) (1992) 287-303
14. Akinniyi, F.A., Wong, A.K.C., Stacey, D.A.: A new algorithm for graph monomorphism based on the projections of the product graph. IEEE Trans. Syst. Man Cybern. 16(5) (1986) 740-751
15. Bunke, H., Messmer, B.T.: Recent advances in graph matching. Int. J. Pattern Recogn. 11(1) (1997) 169-203
16. Bunke, H., Shearer, K.: A graph distance metric based on the maximal common subgraph. Pattern Recogn. Lett. 19(3-4) (1998) 255-259
17. Hidovic, D., Pelillo, M.: Metrics for attributed graphs based on the maximal similarity common subgraph. Int. J. Pattern Recogn. Artif. Intell. 18(3) (2004) 299-313
18. Wallis, W.D., Shoubridge, P., Kraetz, M., Ray, D.: Graph distances using graph union. Pattern Recogn. Lett. 22(6-7) (2001) 701-704
19. Bunke, H., Jiang, X.Y., Kandel, A.: On the minimum common supergraph of two graphs. Computing 65(1) (2000) 13-25
20. Fernández, M.L., Valiente, G.: A graph distance measure combining maximum common subgraph and minimum common supergraph. Pattern Recogn. Lett. 22(6-7) (2001) 753-758
21. Bunke, H.: On a relation between graph edit distance and maximum common subgraph. Pattern Recogn. Lett. 18(8) (1997) 689-694
22. Bunke, H.: Error-tolerant graph matching: A formal framework and algorithms. In: Advances in Pattern Recognition. Volume 1451 of Lecture Notes in Computer Science. Berlin Heidelberg New York, Springer (1998) 1-14
23. Sanfeliu, A., Fu, K.S.: A distance measure between attributed relational graphs for pattern recognition. IEEE Trans. Syst. Man Cybern. 13 3) (1983) 353-363
24. Shapiro, L.G., Haralick, R.M.: Structural descriptions and inexact matching. IEEE Trans. Pattern Anal. 3(5) (1981) 504-519
25. Tsai, W.H., Fu, K.S.: Error-correcting isomorphism of attributed relational graphs for pattern analysis. IEEE Trans. Syst. Man Cybern. 9(12) (1979) 757-769
26. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to NP-Completeness. New York, Freeman (1979)
27. Deville, Y., Gilbert, D., van Helden, J., Wodak, S.J.: An overview of data models for the analysis of biochemical pathways. Brief. Bioinform. 4(3) (2003) 246-259
28. Page, R.D.M., Valiente, G.: An edit script for taxonomic classifications. BMC Bioinform. 6(2005) 208
29. Valiente, G.: Comment to "Polynomial time complexity graph distance computation for web content mining". In Basu, M., Ho, T.K., eds.: Data Complexity in Pattern Recognition. Berlin Heidelberg New York, Springer (2006)
30. Valiente, G.: Algorithms on Trees and Graphs. Berlin Heidelberg New York, Springer (2002)