Finding a maximum clique in an arbitrary graph
SIAM Journal on Computing
Principles of artificial intelligence
Principles of artificial intelligence
Algorithm 457: finding all cliques of an undirected graph
Communications of the ACM
A large database of graphs and its use for benchmarking graph isomorphism algorithms
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Substructure similarity measurement in chinese recipes
Proceedings of the 17th international conference on World Wide Web
Connected substructure similarity search
Proceedings of the 2010 ACM SIGMOD International Conference on Management of data
Exploration of the labelling space given graph edit distance costs
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
A new approach and faster exact methods for the maximum common subgraph problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
A direct algorithm to find a largest common connected induced subgraph of two graphs
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
From exact to approximate maximum common subgraph
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
| Hi-index | 0.00 |
A graph g is called a maximum common subgraph of two graphs, g1 and g2, if there exists no other common subgraph of g1 and g2 that has more nodes than g. For the maximum common subgraph problem, exact and inexact algorithms are known from the literature. Nevertheless, until now no effort has been done for characterizing their performance, mainly for the lack of a large database of graphs. In this paper, three exact and well-known algorithms for maximum common subgraph detection are described. Moreover, a large database containing various categories of pairs of graphs (e.g. randomly connected graphs, meshes, bounded valence graphs...), having a maximum common subgraph of at least two nodes, is presented, and the performance of the three algorithms is evaluated on this database.