Linear time algorithm for isomorphism of planar graphs (Preliminary Report)

By John E. Hopcroft, J. K. Wong. 1974

Subfields: Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Algorithms & Complexity

1. B. Douglas

Citations in the corpus

• The Weisfeiler-Lehman Method and Graph Isomorphism Testing (2011, background): “Efficient GI algorithms do exist for several restricted classes of graphs, such as trees [13], planar graphs [20] and graphs with certain bounded parameters, including valence [22], eigenvalue multiplicity [5] and genus [26].”