Pages that link to "Item:Q1143807"
From MaRDI portal
The following pages link to Relational consistency algorithms and their application in finding subgraph and graph isomorphisms (Q1143807):
Displaying 14 items.
- A logic language for combinatorial optimization (Q918429) (← links)
- AllDifferent-based filtering for subgraph isomorphism (Q991022) (← links)
- A parametric filtering algorithm for the graph isomorphism problem (Q1020495) (← links)
- No more ``Partial'' and ``Full Looking Ahead'' (Q1128494) (← links)
- Forward checking and intelligent backtracking (Q1263983) (← links)
- Partitioning graph matching with constraints (Q1338777) (← links)
- A theoretical evaluation of selected backtracking algorithms. (Q1399134) (← links)
- Backjump-based backtracking for constraint satisfaction problems (Q1605408) (← links)
- Binary vs. non-binary constraints (Q1614859) (← links)
- Propagation engine prototyping with a domain specific language (Q2342591) (← links)
- Partition search for non-binary constraint satisfaction (Q2372239) (← links)
- Theoretical analysis of singleton arc consistency and its extensions (Q2389615) (← links)
- An optimal coarse-grained arc consistency algorithm (Q2457664) (← links)
- Degree Reduction in Labeled Graph Retrieval (Q2828204) (← links)
