An Improved Algorithm for Testing the Planarity of a Graph

DOI10.1109/T-C.1975.224179zbMath0297.68030OpenAlexW1970615718MaRDI QIDQ4051590

F. Rubin

Publication date: 1975

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/t-c.1975.224179

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Algorithms in computer science (68W99) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items (4)

An algorithm for imbedding cubic graphs in the torus ⋮ Improved planarity algorithms ⋮ Orthogonal drawings of graphs for the automation of VLSI circuit design ⋮ Automatische Abbildung eines planaren Graphen in die Ebene mit beliebig vorgebbaren Örtern der Knotenbilder

This page was built for publication: An Improved Algorithm for Testing the Planarity of a Graph