Pages that link to "Item:Q3897079"
From MaRDI portal
The following pages link to A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem (Q3897079):
Displayed 9 items.
- An n log n algorithm for determining the congruity of polyhedra (Q798003) (← links)
- Graph isomorphism problem (Q1057883) (← links)
- A general backtrack algorithm for the isomorphism problem of combinatorial objects (Q1087556) (← links)
- A fast backtrack algorithm for graph isomorphism (Q1106855) (← links)
- Concerning the complexity of deciding isomorphism of block designs (Q1159699) (← links)
- Pattern associativity and the retrieval of semantic networks (Q1202672) (← links)
- Forest embeddings in regular graphs of large girth (Q1252244) (← links)
- Mapping in unknown graph-like worlds (Q4346513) (← links)
- Graph isomorphism restricted by lists (Q5918143) (← links)