A global constraint for graph isomorphism problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 477971
- scientific article; zbMATH DE number 3952822
- On convex relaxation of graph isomorphism
- On tractable parameterizations of graph isomorphism
- A general method for graph isomorphism
- scientific article; zbMATH DE number 4127261
- Graph Invariants as Necessary Conditions for Global Constraints
Cited in
(9)- A parametric filtering algorithm for the graph isomorphism problem
- ``Global graph problems tend to be intractable
- Efficient Graph Kernels for Textual Entailment Recognition
- Filtering for Subgraph Isomorphism
- CP(Graph): Introducing a Graph Computation Domain in Constraint Programming
- The Glasgow subgraph solver: using constraint programming to tackle hard subgraph isomorphism problem variants
- Finding Small Weight Isomorphisms with Additional Constraints is Fixed-Parameter Tractable
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Solving subgraph isomorphism problems with constraint programming
This page was built for publication: A global constraint for graph isomorphism problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5713880)