A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
From MaRDI portal
Publication:3897079
DOI10.1137/0209025zbMath0451.05043OpenAlexW2013054747MaRDI QIDQ3897079
Derek Gordon Corneil, David G. Kirkpatrick
Publication date: 1980
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0209025
graph isomorphismgraph isomorphism problemautomorphism partitionisomorphism complete problemsregular high girth graphs
Related Items
Mapping in unknown graph-like worlds, A general backtrack algorithm for the isomorphism problem of combinatorial objects, A fast backtrack algorithm for graph isomorphism, Concerning the complexity of deciding isomorphism of block designs, Pattern associativity and the retrieval of semantic networks, Forest embeddings in regular graphs of large girth, Graph isomorphism restricted by lists, Graph isomorphism problem, An n log n algorithm for determining the congruity of polyhedra