On the subgraph epimorphism problem

DOI10.1016/j.dam.2013.08.008zbMath1300.05179OpenAlexW2065982363MaRDI QIDQ741740

François Fages, Thierry Martinez, Sylvain Soliman, Steven Gay, Christine Solnon

Publication date: 12 September 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2013.08.008

zbMATH Keywords

model reductionconstraint solvingsystems biologygraph distancesubgraph epimorphism

Mathematics Subject Classification ID

Applications of graph theory (05C90) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Distance in graphs (05C12) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Directed graphs (digraphs), tournaments (05C20) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Systems biology, networks (92C42)

Related Items (3)

The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants ⋮ On estimating derivatives of input signals in biochemistry ⋮ Inferring reaction systems from ordinary differential equations

Cites Work

• Solving subgraph isomorphism problems with constraint programming
• Graph minors. XX: Wagner's conjecture
• AllDifferent-based filtering for subgraph isomorphism
• A parametric filtering algorithm for the graph isomorphism problem
• Graph minor theory
• Constraint satisfaction algorithms for graph pattern matching
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the subgraph epimorphism problem