A non-factorial algorithm for canonical numbering of a graph

DOI10.1016/0196-6774(84)90015-4zbMath0547.68067OpenAlexW2057640741MaRDI QIDQ3339303

Mark K. Goldberg, Derek Gordon Corneil

Publication date: 1984

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(84)90015-4

zbMATH Keywords

canonical formcanonical numbering of the verticesgraph certificategraph isomorphism algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (2)

Is Polynomial Time Choiceless? ⋮ Hashing and canonicalizing Notation 3 graphs

This page was built for publication: A non-factorial algorithm for canonical numbering of a graph