A Linear Time Planarity Algorithm for 2-Complexes

DOI10.1145/322154.322156MaRDI QIDQ3048280zbMATH OpenOpenAlexFDO

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 complexitydepth-first searchgraph planaritylinear time planarity algorithmsimplicial complextwo-dimensional complexes

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

(5)

• On the planarity of infinite 2-complexes
• Some problems in topological graph theory
• Polyhedral suspensions of arbitrary genus
• Geometric embeddability of complexes is \(\exists\mathbb{R}\)-complete
• 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)