AllDifferent-based filtering for subgraph isomorphism
From MaRDI portal
Publication:991022
DOI10.1016/J.ARTINT.2010.05.002zbMATH Open1209.68383OpenAlexW2143163611MaRDI QIDQ991022FDOQ991022
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
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
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- An Algorithm for Subgraph Isomorphism
- Title not available (Why is that?)
- Handbook of constraint programming.
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Constraint satisfaction algorithms for graph pattern matching
- Theoretical analysis of singleton arc consistency and its extensions
- Solving subgraph isomorphism problems with constraint programming
- Relational consistency algorithms and their application in finding subgraph and graph isomorphisms
Cited In (20)
- An algorithm for blocking regular fractional factorial 2-level designs with clear two-factor interactions
- A parametric filtering algorithm for the graph isomorphism problem
- Privacy-preserving subgraph matching protocol for two parties
- Graph-Based Representations in Pattern Recognition
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
- Degree reduction in labeled graph retrieval
- When subgraph isomorphism is really hard, and why this matters for graph databases
- 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
- SLF: a passive parallelization of subgraph isomorphism
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- A long trip in the charming world of graphs for pattern recognition
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem
- G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU
- On the subgraph epimorphism problem
- VF2++ -- an improved subgraph isomorphism algorithm
- A Bound for Non-subgraph Isomorphism
- A new algorithm for induced subgraph isomorphism
Uses Software
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)
