Access Restriction

Author Galil, Zvi ♦ Hoffmann, Christoph M. ♦ Luks, Eugene M. ♦ Schnorr, Claus P. ♦ Weber, Andreas
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Copyright Year ©1987
Language English
Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science
Abstract This paper describes an $\textit{O}(\textit{n}3log\textit{n})$ deterministic algorithm and an $\textit{O}(\textit{n}3)$ Las Vegas algorithm for testing whether two given trivalent graphs on $\textit{n}$ vertices are isomorphic. In fact, the algorithms construct the set of all isomorphisms between two such graphs, presenting, in particular, generators for the group of all automorphisms of a trivalent graph. The algorithms are based upon the original polynomial-time solution to these problems by Luks but they introduce numerous speedups. These include improved permutation-group algorithms that exploit the structure of the underlying 2-groups. A remarkable property of the Las Vegas algorithm is that it computes the set of all isomorphisms between two trivalent graphs for the cost of computing only those isomorphisms that map a specified edge to a specified edge.
ISSN 00045411
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 1987-07-01
Publisher Place New York
e-ISSN 1557735X
Journal Journal of the ACM (JACM)
Volume Number 34
Issue Number 3
Page Count 19
Starting Page 513
Ending Page 531

Open content in new tab

   Open content in new tab
Source: ACM Digital Library