An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm (1993)
by
Kurt Mehlhorn
,
Petra Mutzel
,
Stefan Näher
| Citations: | 4 - 0 self |
BibTeX
@MISC{Mehlhorn93animplementation,
author = {Kurt Mehlhorn and Petra Mutzel and Stefan Näher},
title = {An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm},
year = {1993}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We describe an implementation of the Hopcroft and Tarjan planarity test and embedding algorithm. The program tests the planarity of the input graph and either constructs a combinatorial embedding (if the graph is planar) or exhibits a Kuratowski subgraph (if the graph is non-planar).
Citations
| 43 | Data Structures and Algorithms - Mehlhorn - 1984 |
| 37 | LEDA: A library of efficient data types and algorithms - Mehlhorn, Naher - 1989 |
| 29 | Depth-first search and Kuratowski subgraphs - Williamson - 1984 |
| 28 | 1994], On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm - Mehlhorn, Mutzel |
| 13 | Data Structures and Efficient Algorithms - Mehlhorn - 1984 |
