Filtering for Subgraph Isomorphism

DOI10.1007/978-3-540-74970-7_51MaRDI QIDQ3523085zbMATH OpenOpenAlexFDO

Authors

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

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• AllDifferent-based filtering for subgraph isomorphism
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
• A parametric filtering algorithm for the graph isomorphism problem
• Algorithms for subgraph isomorphism in graph pattern mining
• scientific article; zbMATH DE number 4206026
• Subgraph detection
• Subgraph isomorphism in graph classes

Cites work

• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
• Filtering for Subgraph Isomorphism
• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems

Cited in

(17)

• A parametric filtering algorithm for the graph isomorphism problem
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
• Filtering graphs to check isomorphism and extracting mapping by using the conductance electrical model
• Subgraph detection
• Filtering for Subgraph Isomorphism
• A Polynomial Algorithm for Submap Isomorphism
• Polynomial algorithms for open plane graph and subgraph isomorphisms
• When subgraph isomorphism is really hard, and why this matters for graph databases
• Constraint satisfaction algorithms for graph pattern matching
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• Combining Two Structured Domains for Modeling Various Graph Matching Problems
• A Bound for Non-subgraph Isomorphism
• Solving subgraph isomorphism problems with constraint programming
• G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU
• A convex relaxation bound for subgraph isomorphism
• On the subgraph epimorphism problem
• AllDifferent-based filtering for subgraph isomorphism

This page was built for publication: Filtering for Subgraph Isomorphism

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