Pages that link to "Item:Q4792942"
From MaRDI portal
The following pages link to Constraint satisfaction algorithms for graph pattern matching (Q4792942):
Displaying 16 items.
- Solving subgraph isomorphism problems with constraint programming (Q606895) (← links)
- On the subgraph epimorphism problem (Q741740) (← links)
- Matching graphs with unique node labels (Q851709) (← links)
- A dynamic generating graphical model for point-sets matching (Q872376) (← links)
- AllDifferent-based filtering for subgraph isomorphism (Q991022) (← links)
- A long trip in the charming world of graphs for pattern recognition (Q1677050) (← links)
- Efficient subgraph matching using topological node feature constraints (Q1677053) (← links)
- An inductive characterization of matching in binding bigraphs (Q1941899) (← links)
- Multi-objective optimization model and evolutional solution of network node matching problem (Q2147883) (← links)
- On the Complexity of Concurrent Multiset Rewriting (Q2806558) (← links)
- Matching of Bigraphs (Q2867883) (← links)
- Filtering for Subgraph Isomorphism (Q3523085) (← links)
- Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms (Q3627718) (← links)
- Efficient Suboptimal Graph Isomorphism (Q3637695) (← links)
- GETGRATS (Q4923529) (← links)
- Combining Two Structured Domains for Modeling Various Graph Matching Problems (Q5302726) (← links)
