A Linear-Time Algorithm for Isomorphism of Graphs of Bounded Average Genus

Authors:
Jianer Chen
Affiliations:
-
Venue:
SIAM Journal on Discrete Mathematics
Year:
1994

Citing 0
Cited 2

Graph and map isomorphism and all polyhedral embeddings in linear time

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Physically-motivated dynamical algorithms for the graph isomorphism problem

Quantum Information & Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A structure theorem is proved for the class of graphs of bounded average genus, which leads to a linear-time algorithm for isomorphism of such graphs.