polynomial time algorithms / search process / search tree / mathematics software / nauty algorithm / search tree examining choices / search trees / polynomial time algorithm / large automorphism / depth-first search / /
Organization
the University of Nebraska / Nebraska Research Council / /
Person
Stephen G. Hartke / A. J. Radcliffe Abstract / Brendan McKay / /
Position
canonical representative / first author / /
Technology
known polynomial time algorithm / MCKAY’S CANONICAL GRAPH LABELING ALGORITHM / Canonical Graph Labeling Algorithm / polynomial time algorithms / nauty algorithm / /
Contemporary Mathematics McKay’s Canonical Graph Labeling Algorithm Stephen G. Hartke and A. J. Radcliffe Abstract. The problem of deciding whether two graphs are isomorphic is