AllDifferent-based filtering for subgraph isomorphism
From MaRDI portal
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
- 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.
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- 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
(23)- A parametric filtering algorithm for the graph isomorphism problem
- 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
- VF2++ -- an improved subgraph isomorphism algorithm
- Correct filtering for subgraph isomorphism search in compressed vertex-labeled graphs
- Degree reduction in labeled graph retrieval
- Filtering for Subgraph Isomorphism
- A new algorithm for induced subgraph isomorphism
- When subgraph isomorphism is really hard, and why this matters for graph databases
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- Privacy-preserving subgraph matching protocol for two parties
- Graph-Based Representations in Pattern Recognition
- A Bound for Non-subgraph Isomorphism
- G-Morph: induced subgraph isomorphism search of labeled graphs on a GPU
- SLF: a passive parallelization of subgraph isomorphism
- PathLAD+: Towards effective exact methods for subgraph isomorphism problem
- GMFOLD: subgraph matching for high-throughput DNA-aptamer secondary structure classification and machine learning interpretability
- A signature scheme constructed from zero knowledge argument of knowledge for the subgraph isomorphism problem
- Enhancing the global and local robustness of networks: a network motif-based approach
- On the subgraph epimorphism problem
- An algorithm for blocking regular fractional factorial 2-level designs with clear two-factor interactions
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)
