A Polynomial-time Metric for Outerplanar Graphs
暂无分享,去创建一个
[1] Thomas G. Dietterich. What is machine learning? , 2020, Archives of Disease in Childhood.
[2] Horst Bunke,et al. On a relation between graph edit distance and maximum common subgraph , 1997, Pattern Recognit. Lett..
[3] J. Munkres. ALGORITHMS FOR THE ASSIGNMENT AND TRANSIORTATION tROBLEMS* , 1957 .
[4] Peter Willett,et al. Maximum common subgraph isomorphism algorithms for the matching of chemical structures , 2002, J. Comput. Aided Mol. Des..
[5] Peter Willett,et al. RASCAL: Calculation of Graph Similarity using Maximum Common Edge Subgraphs , 2002, Comput. J..
[6] Horst Bunke,et al. A graph distance metric based on the maximal common subgraph , 1998, Pattern Recognit. Lett..
[7] Maciej M. Syslo. The Subgraph Isomorphism Problem for Outerplanar Graphs , 1982, Theor. Comput. Sci..
[8] John Bradshaw,et al. Similarity and Dissimilarity Methods for Processing Chemical Structure Databases , 1998, Comput. J..
[9] S. Mitchell. Linear algorithms to recognize outerplanar and maximal outerplanar graphs , 1979 .
[10] Andrzej Lingas,et al. Subgraph Isomorphism for Biconnected Outerplanar Graphs in Cubic Time , 1989, Theor. Comput. Sci..
[11] Maciej M. SysŁ. The subgraph isomorphism problem for outerplanar graphs , 1982 .
[12] J. J. McGregor,et al. Backtrack search algorithms and the maximal common subgraph problem , 1982, Softw. Pract. Exp..
[13] Jan Ramon,et al. Frequent subgraph mining in outerplanar graphs , 2006, KDD '06.
[14] T. Akutsu. A Polynomial Time Algorithm for Finding a Largest Common Subgraph of almost Trees of Bounded Degree , 1993 .
[15] Ron Shamir,et al. Faster subtree isomorphism , 1997, Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems.
[16] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[17] Frank Harary,et al. Graph Theory , 2016 .