AllDifferent-based filtering for subgraph isomorphism

DOI10.1016/j.artint.2010.05.002zbMath1209.68383OpenAlexW2143163611MaRDI QIDQ991022

Christine Solnon

Publication date: 2 September 2010

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.artint.2010.05.002

zbMATH Keywords

constraint programmingsubgraph isomorphismall different constraint

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Related Items (10)

An algorithm for blocking regular fractional factorial 2-level designs with clear two-factor interactions ⋮ An algorithm for weighted sub-graph matching based on gradient flows ⋮ A long trip in the charming world of graphs for pattern recognition ⋮ On the complexity of submap isomorphism and maximum common submap problems ⋮ Efficient subgraph matching using topological node feature constraints ⋮ The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants ⋮ VF2++ -- an improved subgraph isomorphism algorithm ⋮ Privacy-Preserving Subgraph Matching Protocol for Two Parties ⋮ On the subgraph epimorphism problem ⋮ Degree Reduction in Labeled Graph Retrieval

Uses Software

• COMET

Cites Work

• Unnamed Item
• Unnamed Item
• Solving subgraph isomorphism problems with constraint programming
• Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
• Theoretical analysis of singleton arc consistency and its extensions
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

This page was built for publication: AllDifferent-based filtering for subgraph isomorphism