O(n2) algorithms for graph planarization

DOI10.1007/3-540-50728-0_56MaRDI QIDQ6199475

M. N. S. Swamy, Krishnaiyan Thulasiraman, R. Jayakumar

Publication date: 28 February 2024

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Computing an st-numbering
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• On maximal planarization of nonplanar graphs
• Planar embedding: linear-time algorithms for vertex placement and edge orderings
• Efficient Planarity Testing
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: O(n2) algorithms for graph planarization