Enumerating all connected maximal common subgraphs in two graphs
Top Cited Papers
- 27 October 2000
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 250 (1-2), 1-30
- https://doi.org/10.1016/s0304-3975(00)00286-3
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein StructuresJournal of Computational Biology, 1996
- Threading a database of protein coresProteins-Structure Function and Bioinformatics, 1995
- Identification of Tertiary Structure Resemblance in Proteins Using a Maximal Common Subgraph Isomorphism AlgorithmJournal of Molecular Biology, 1993
- Algorithms for the identification of three-dimensional maximal common substructuresJournal of Chemical Information and Computer Sciences, 1987
- Finding a Maximum Independent SetSIAM Journal on Computing, 1977
- A node covering algorithmNaval Research Logistics Quarterly, 1977
- Algorithm 457: finding all cliques of an undirected graphCommunications of the ACM, 1973
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal GraphSIAM Journal on Computing, 1972
- On cliques in graphsIsrael Journal of Mathematics, 1965
- Congruent Graphs and the Connectivity of GraphsAmerican Journal of Mathematics, 1932