Chapter

Graph-Theoretic Concepts in Computer Science

Volume 657 of the series Lecture Notes in Computer Science pp 103-113

Date:

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

  • Jianer ChenAffiliated withTexas A&M University

* Final gross prices may vary according to local VAT.

Get Access

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.