A subexponential algorithm for trivalent graph isomorphism

Front Cover
Cornell University, May, 1980 - Graph theory - 62 pages
0 Reviews
This report contains two results: First, a polynomial-time algorithm to test color preserving isomorphism of two vertex-colored graphs in which each color class is of size k or less; Second, we improve Hoffman's algorithm for determining the automorphism group of a trivalent cone graph to deterministic time 0(n(clogn)) and extend it to arbitrary trivalent graphs. (Author).

From inside the book

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

Computing the Intersection of Two Groups
9
Cone Graphs and Hoffmann s Algorithm
20
Conclusion
28

Common terms and phrases

Bibliographic information