ACM Home Page
Please provide us with feedback. Feedback
Testing isomorphism of cone graphs(Extended Abstract)
Full text PdfPdf (457 KB)
Source Annual ACM Symposium on Theory of Computing archive
Proceedings of the twelfth annual ACM symposium on Theory of computing table of contents
Los Angeles, California, United States
Pages: 244 - 251  
Year of Publication: 1980
ISBN:0-89791-017-6
Author
Sponsors
ACM: Association for Computing Machinery
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 11,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/800141.804672
What is a DOI?

ABSTRACT

We give algorithms to decide graph isomorphism in a subclass of graphs which we call cone graphs. A cone graph is an undirected graph for which there exists a vertex r which uniquely determines a breadth-first search (BFS) tree. Equivalently, all shortest paths from r to any other graph vertex are unique. Our algorithms may be used either nondeterministically or probabilistically. Used as probabilistic algorithms, they return always a correct answer, but with an expected running time only.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
L. Babai, Monte Carlo Algorithms in Graph Isomorphism Testing, submitted to SIAM J. on Computing (1979)
 
2
J. Hopcroft and R. Tarjan, A VlogV Algorithm for Isomorphism of Triconnected Planar Graphs, J. of Comp. and Sys.Sci. 7(1973) 323–331
3
 
4
R. Lipton, The Beacon Set Approach to Graph Isomorphism, SIAM J. on Comp. (to appear)
5
6
 
7
G. Miller, Personal Communication
 
8
M. Hall Jr., The Theory of Groups, -MacMillan, New York 1959
 
9
G. Miller, Isomorphism Testing For Graphs of Bounded Genus, Manuscript (1979)


Collaborative Colleagues:
Christoph M. Hoffmann: colleagues