On the subgraph epimorphism problem
DOI10.1016/J.DAM.2013.08.008zbMATH Open1300.05179OpenAlexW2065982363MaRDI QIDQ741740FDOQ741740
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
Recommendations
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)
Cites Work
- Title not available (Why is that?)
- Graph minors. XX: Wagner's conjecture
- The complexity of theorem-proving procedures
- Graph minor theory
- Title not available (Why is that?)
- Title not available (Why is that?)
- Constraint satisfaction algorithms for graph pattern matching
- A parametric filtering algorithm for the graph isomorphism problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving subgraph isomorphism problems with constraint programming
- Title not available (Why is that?)
- AllDifferent-based filtering for subgraph isomorphism
Cited In (4)
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)