A linear time algorithm for isomorphism of graphs of bounded average genus

  • Jianer Chen
Conference paper

DOI: 10.1007/3-540-56402-0_40

Volume 657 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Chen J. (1993) A linear time algorithm for isomorphism of graphs of bounded average genus. In: Mayr E.W. (eds) Graph-Theoretic Concepts in Computer Science. WG 1992. Lecture Notes in Computer Science, vol 657. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1993

Authors and Affiliations

  • Jianer Chen
    • 1
  1. 1.Texas A&M UniversityCollege StationUSA