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
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
Chen, J.: A linear time algorithm for isomorphism of graphs of bounded average genus. Technical Report 91-015, Dept. of Computer Science, Texas A&M University (1991)
Chen, J., Gross, J. L.: Limit points for average genus (I): 3-connected and 2-connected simplicial graphs. J. Comb. Theory Ser. B 55 (1992) 83–103
Chen, J., Gross, J. L.: Limit points for average genus (II): 2-connected non-simplicial graphs. J. Comb. Theory Ser. B (to appear)
Chen, J., Gross, J. L.: Kuratowski-type theorem for average genus. J. Comb. Theory Ser. B (to appear)
Chen, J., Gross, J. L.: No lower limit points for average genus. Graph Theory, Combinatorics, Algorithms, and Applications, Ed. Alavi and others, Wiley Interscience (to appear)
Filotti, I. S., Mayer, J. N.: A polynomial-time algorithm for determining the isomorphism of graphs of fixed genus. Proc. 12th Annual ACM Symposium on Theory of Computing (1980) 236–243
Gross, J. L., Furst, M. L.: Hierarchy for imbedding-distribution invariants of a graph. J. Graph Theory 11 (1987) 205–220
Gross, J. L., Tucker, T. W.: Topological Graph Theory, Wiley-Interscience, New York (1987)
Hopcroft, J. E., Wong, J. K.: Linear time algorithm for isomorphism of planar graphs. Proc. 6th Annual ACM Symposium on Theory of Computing (1974) 172–184
Ramachandran, V.: Parallel open ear decomposition with applications to graph biconnectivity and triconnectivity. Synthesis of Parallel Algorithms, Ed. Reif, MorganKaufmann (to appear)
Tutte, W. T.: Connectivity in Graphs, University of Toronto Press (1966)
Tutte, W. T.: Graph Theory. Addison-Wesley Publishing Company (1984)
Whitney, H.: Non-separable and planar graphs. Trans. Amer. Math. Soc. 34 (1932) 339–362
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/3-540-56402-0_40
Download citation
DOI: https://doi.org/10.1007/3-540-56402-0_40
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56402-7
Online ISBN: 978-3-540-47554-5
eBook Packages: Springer Book Archive