On the Approximability of the Maximum Common Subgraph Problem

Efficient extraction of mapping rules of atoms from enzymatic reaction data

RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology

Approximating the Maximum Isomorphic Agreement Subtree Is Hard

COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching

Finding the maximum common subgraph of a partial k-tree and a graph with a polynomially bounded number of spanning trees

Information Processing Letters

Text-independent speaker recognition using graph matching

Pattern Recognition Letters

On parameterized complexity of the Multi-MCS problem

Theoretical Computer Science

Weighted spectral distribution for internet topology analysis: theory and applications

IEEE/ACM Transactions on Networking (TON)

Generic and automatic address configuration for data center networks

Proceedings of the ACM SIGCOMM 2010 conference

Graph homomorphism revisited for graph matching

Proceedings of the VLDB Endowment

Capturing topology in graph pattern matching

Proceedings of the VLDB Endowment

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

Approximation algorithms for graph homomorphism problems

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

DAC: generic and automatic address configuration for data center networks

IEEE/ACM Transactions on Networking (TON)

A polynomial-time algorithm for computing the maximum common subgraph of outerplanar graphs of bounded degree

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science

Strong simulation: Capturing topology in graph pattern matching

ACM Transactions on Database Systems (TODS)