A filtering algorithm for constraints of difference in CSPs
AAAI '94 Proceedings of the twelfth national conference on Artificial intelligence (vol. 1)
A petri net application to model metabolic processes
Systems Analysis Modelling Simulation
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
Petri Net Representations in Metabolic Pathways
Proceedings of the 1st International Conference on Intelligent Systems for Molecular Biology
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Computational complexity of graph compaction
Computational complexity of graph compaction
Constraint satisfaction algorithms for graph pattern matching
Mathematical Structures in Computer Science
Graph Minors. XX. Wagner's conjecture
Journal of Combinatorial Theory Series B - Special issue dedicated to professor W. T. Tutte
Graph edit distance with node splitting and merging, and its application to diatom identification
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Measuring the similarity of labeled graphs
ICCBR'03 Proceedings of the 5th international conference on Case-based reasoning: Research and Development
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
Hi-index | 0.04 |
In this paper we study the problem of deciding the existence of a subgraph epimorphism between two graphs. Our interest in this variant of graph matching problem stems from the study of model reductions in systems biology, where large systems of biochemical reactions can be naturally represented by bipartite digraphs of species and reactions. In this setting, model reduction can be formalized as the existence of a sequence of vertex deletion and merge operations that transforms a first reaction graph into a second graph. This problem is in turn equivalent to the existence of a subgraph (corresponding to delete operations) epimorphism (i.e. surjective homomorphism, corresponding to merge operations) from the first graph to the second. In this paper, we study theoretical properties of subgraph epimorphisms in general directed graphs. We first characterize subgraph epimorphisms (SEPI), subgraph isomorphisms (SISO) and graph epimorphisms (EPI) in terms of graph transformation operations. Then we study the graph distance measures induced by these transformations. We show that they define metrics on graphs and compare them. On the algorithmic side, we show that the SEPIexistence problem is NP-complete by reduction of SAT and present a constraint satisfaction algorithm that has been successfully used to solve practical SEPIproblems on a large benchmark of reaction graphs from systems biology.