AllDifferent-based filtering for subgraph isomorphism

DOI10.1016/J.ARTINT.2010.05.002MaRDI QIDQ991022zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Filtering for Subgraph Isomorphism
• Solving subgraph isomorphism problems with constraint programming
• A parametric filtering algorithm for the graph isomorphism problem
• An Algorithm Portfolio for the Sub-graph Isomorphism Problem
• When subgraph isomorphism is really hard, and why this matters for graph databases

Cites work

• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• An Algorithm for Subgraph Isomorphism
• Constraint satisfaction algorithms for graph pattern matching
• Handbook of constraint programming.
• Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
• Solving subgraph isomorphism problems with constraint programming
• Theoretical analysis of singleton arc consistency and its extensions

Cited in

(20)

• Privacy-preserving subgraph matching protocol for two parties
• An algorithm for blocking regular fractional factorial 2-level designs with clear two-factor interactions
• A Bound for Non-subgraph Isomorphism
• G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU
• Degree reduction in labeled graph retrieval
• A new algorithm for induced subgraph isomorphism
• SLF: a passive parallelization of subgraph isomorphism
• A parametric filtering algorithm for the graph isomorphism problem
• On the subgraph epimorphism problem
• A long trip in the charming world of graphs for pattern recognition
• When subgraph isomorphism is really hard, and why this matters for graph databases
• VF2++ -- an improved subgraph isomorphism algorithm
• Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
• The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
• Graph-Based Representations in Pattern Recognition
• An algorithm for weighted sub-graph matching based on gradient flows
• Efficient subgraph matching using topological node feature constraints
• On the complexity of submap isomorphism and maximum common submap problems
• Filtering for Subgraph Isomorphism
• PathLAD+: Towards effective exact methods for subgraph isomorphism problem

Describes a project that uses

Uses Software

• COMET

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

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