A Linear Time Planarity Algorithm for 2-Complexes

DOI10.1145/322154.322156zbMATH Open0413.68071OpenAlexW2051630414MaRDI QIDQ3048280FDOQ3048280

Authors: Jonathan L. Gross, Ronald H. Rosen 

Publication date: 1979

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/322154.322156

zbMATH Keywords

computational complexitysimplicial complexdepth-first searchtwo-dimensional complexesgraph planaritylinear time planarity algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Discrete mathematics in relation to computer science (68R99)

Cited In (4)

• Some problems in topological graph theory
• Polyhedral suspensions of arbitrary genus
• On the planarity of infinite 2-complexes
• Invariants of graph drawings in the plane

This page was built for publication: A Linear Time Planarity Algorithm for 2-Complexes

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