semanticscholar.org

[PDF] On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm | Semantic Scholar

@article{Mehlhorn1996OnTE,
  title={On the embedding phase of the Hopcroft and Tarjan planarity testing algorithm},
  author={Kurt Mehlhorn and Petra Mutzel},
  journal={Algorithmica},
  year={1996},
  volume={16},
  pages={233-242},
  url={https://api.semanticscholar.org/CorpusID:10014462}
}

A detailed description of the embedding phase of the Hopcroft and Tarjan planarity testing algorithm and an implementation of this paper can be found in [MMN].

64 Citations

24 References

Embedding planar graphs on the grid

We show that each plane graph of order n 2 3 has a straight line embedding on the n-2 by n-2 grid. This embedding is computable in time O(n). A nice feature of the vertex-coordinates is that they…

Efficient Planarity Testing

An efficient algorithm to determine whether an arbitrary graph G can be embedded in the plane is described, which used depth-first search and has time and space bounds.