GraphTheoretic Concepts in Computer Science
Volume 657 of the series Lecture Notes in Computer Science pp 103113
Date:
A linear time algorithm for isomorphism of graphs of bounded average genus
 Jianer ChenAffiliated withTexas A&M University
Abstract
Recent progress in topological graph theory has shown potential applicability of average genus to graph isomorphism testing. The present paper describes an initial effort at combining topological invariants with combinatorial analysis to design efficient graph isomorphism algorithms. In particular, a linear time algorithm for isomorphism of graphs of bounded average genus is presented.
 Title
 A linear time algorithm for isomorphism of graphs of bounded average genus
 Book Title
 GraphTheoretic Concepts in Computer Science
 Book Subtitle
 18th International Workshop, WG '92 WiesbadenNaurod, Germany, June 18–20, 1992 Proceedings
 Pages
 pp 103113
 Copyright
 1993
 DOI
 10.1007/3540564020_40
 Print ISBN
 9783540564027
 Online ISBN
 9783540475545
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 657
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 eBook Packages
 Editors
 Authors

 Jianer Chen ^{(1)}
 Author Affiliations

 1. Texas A&M University, 77843, College Station, TX, USA
Continue reading...
To view the rest of this content please follow the download PDF link above.