Mehlhorn, Kurt, Mutzel, Petra ORCID: 0000-0001-7621-971X and Näher, Stefan (1994). An Implementation of the Hopcroft and Tarjan Planarity Test and Embedding Algorithm. ["eprint_fieldopt_monograph_type_preprint" not defined].

[img]
Preview
 PDF
zpr94-163.pdf
Download (417kB) | Preview

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

Item Type: Preprints, Working Papers or Reports (["eprint_fieldopt_monograph_type_preprint" not defined])
Creators:
CreatorsEmailORCIDORCID Put Code
Mehlhorn, KurtUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
Mutzel, PetraUNSPECIFIEDorcid.org/0000-0001-7621-971XUNSPECIFIED
Näher, StefanUNSPECIFIEDUNSPECIFIEDUNSPECIFIED
URN: urn:nbn:de:hbz:38-546896
Date: 1994
Language: English
Faculty: Faculty of Mathematics and Natural Sciences
Divisions: Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science
Subjects: Data processing Computer science
Refereed: No
URI: http://kups.ub.uni-koeln.de/id/eprint/54689

Downloads

Downloads per month over past year

Export

Actions (login required)

View Item View Item