An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm

Mehlhorn, Kurt and Mutzel, Petra and Näher, Stefan (1994) An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm.
Technical Report , 46 p.

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).


Actions:
Download: [img] Postscript
Download (779kB) | Preview
Editorial actions: View Item View Item (Login required)
Deposit Information:
ZAIK Number: zpr94-163
Depositing User: Archive Admin
Date Deposited: 02 Apr 2001 00:00
Last Modified: 19 Jan 2012 11:15
URI: http://e-archive.informatik.uni-koeln.de/id/eprint/163