Constraint satisfaction algorithms for graph pattern matching
From MaRDI portal
Recommendations
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Utilizing constraint satisfaction techniques for efficient graph pattern matching
- Solving subgraph isomorphism problems with constraint programming
- Filtering for Subgraph Isomorphism
- Constraint programming and graph algorithms.
Cited in
(21)- A long trip in the charming world of graphs for pattern recognition
- Efficient subgraph matching using topological node feature constraints
- An inductive characterization of matching in binding bigraphs
- Multi-objective optimization model and evolutional solution of network node matching problem
- Utilizing constraint satisfaction techniques for efficient graph pattern matching
- On the complexity of concurrent multiset rewriting
- Matching of bigraphs
- Incremental graph pattern matching
- Filtering for Subgraph Isomorphism
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
- Efficient Suboptimal Graph Isomorphism
- Simulation relations for pattern matching in directed graphs
- Constraint solving over OCR graphs
- Constraint programming techniques for solving problems on graphs
- GETGRATS: a summary of scientific results (with annotated bibliography)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems
- Solving subgraph isomorphism problems with constraint programming
- On the subgraph epimorphism problem
- Matching graphs with unique node labels
- A dynamic generating graphical model for point-sets matching
- AllDifferent-based filtering for subgraph isomorphism
This page was built for publication: Constraint satisfaction algorithms for graph pattern matching
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4792942)
