Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs

DOI10.1137/S0895480191221453zbMath0813.05021MaRDI QIDQ4317708

Balaji Raghavachari, Xin He, Ming-Yang Kao, Martin Fuerer

Publication date: 20 December 1994

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

planar graphsparallel algorithmsstraight-line grid embeddings

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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) Distributed algorithms (68W15)

Related Items (2)

Grid embedding of 4-connected plane graphs ⋮ Fast and compact planar embeddings

This page was built for publication: Optimal Parallel Algorithms for Straight-Line Grid Embeddings of Planar Graphs