On the subgraph epimorphism problem

DOI10.1016/J.DAM.2013.08.008MaRDI QIDQ741740zbMATH OpenOpenAlexFDO

Authors Steven Gay, François Fages, Thierry Martinez, Sylvain Soliman, 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

systems biologymodel reductiongraph distanceconstraint solvingsubgraph epimorphism

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2097443
• scientific article; zbMATH DE number 4081609
• AllDifferent-based filtering for subgraph isomorphism
• Filtering for Subgraph Isomorphism
• The subgraph homeomorphism problem

Cites work

• scientific article; zbMATH DE number 2089760 (Why is no real title available?)
• scientific article; zbMATH DE number 1305547 (Why is no real title available?)
• scientific article; zbMATH DE number 2043358 (Why is no real title available?)
• scientific article; zbMATH DE number 2117181 (Why is no real title available?)
• scientific article; zbMATH DE number 814403 (Why is no real title available?)
• scientific article; zbMATH DE number 970795 (Why is no real title available?)
• A parametric filtering algorithm for the graph isomorphism problem
• AllDifferent-based filtering for subgraph isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• Graph minor theory
• Graph minors. XX: Wagner's conjecture
• Solving subgraph isomorphism problems with constraint programming
• The complexity of theorem-proving procedures

Cited in

(4)

• Artificial intelligence in biological modelling
• On estimating derivatives of input signals in biochemistry
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• Inferring reaction systems from ordinary differential equations

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q741740)