Filtering for Subgraph Isomorphism

DOI10.1007/978-3-540-74970-7_51zbMath1145.68535MaRDI QIDQ3523085

No author found.

Publication date: 2 September 2008

Published in: Principles and Practice of Constraint Programming – CP 2007 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-74970-7_51

Mathematics Subject Classification ID

68R10: Graph theory (including graph drawing) in computer science

68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)

05C60: Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.)

Related Items

Combining Two Structured Domains for Modeling Various Graph Matching Problems, Solving subgraph isomorphism problems with constraint programming, A parametric filtering algorithm for the graph isomorphism problem, Filtering for Subgraph Isomorphism, A Polynomial Algorithm for Submap Isomorphism

Cites Work

• Filtering for Subgraph Isomorphism
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Unnamed Item
• Unnamed Item