Date: 04 Jun 2005

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

* 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.

Supported in part by the National Science Foundation under Grant CCR-9110824