A V log V algorithm for isomorphism of triconnected planar graphs

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph theory (05C99) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

Efficient Planarity Testing
An Efficient Algorithm for Graph Isomorphism
Title not available (Why is that?)
A V log V algorithm for isomorphism of triconnected planar graphs
Title not available (Why is that?)
\(A\,V^ 2\) algorithm for determining isomorphism of planar graphs

Cited In (29)

Title not available (Why is that?)
The graph isomorphism problem and approximate categories
The Power of the Weisfeiler-Leman Algorithm to Decompose Graphs
A V log V algorithm for isomorphism of triconnected planar graphs
On the coding of ordered graphs
Complexity classes of equivalence problems revisited
Complement reducible graphs
Isomorphisms of maps on the sphere
A speed-up for the commute between subword trees and DAWGs.
Decremental SPQR-trees for Planar Graphs
Random models and analyses for chemical graphs
A remark on the time complexity of the subtree problem
The power of the Weisfeiler-Leman algorithm to decompose graphs
Neighborhood hypergraphs of bipartite graphs
Ego‐centered and local roles: A graph theoretic approach
Fourier acceleration of iterative processes in disordered systems.
An algorithm for drawing general undirected graphs
Generating Nonisomorphic Maps without Storing Them
An algorithm for imbedding cubic graphs in the torus
A nonfactorial algorithm for testing isomorphism of two graphs
A simple linear-time algorithm for computing the centroid and canonical form of a plane graph and its applications
A linear-time algorithm for isomorphism of a subclass of chordal graphs
Counting the number of perfect matchings in \(K_{5}\)-free graphs
An n log n algorithm for determining the congruity of polyhedra
Generation of trees of a graph with the use of decomposition
The simultaneous conjugacy problem in the symmetric group
On some complexity properties of N-free posets and posets with bounded decomposition diameter
Subcomplete generalizations of graph isomorphism
Fixed-Parameter Tractable Canonization and Isomorphism Test for Graphs of Bounded Treewidth

This page was built for publication: A V log V algorithm for isomorphism of triconnected planar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2264677)