Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations

DOI10.1007/978-3-319-03841-4_33zbMath1406.68069OpenAlexW2143973853MaRDI QIDQ2867674

Timothy M. Chan, Stephen Kiazyk, Hella-Franziska Hoffmann, Anna Lubiw

Publication date: 20 December 2013

Published in: Graph Drawing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-03841-4_33

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Planar graphs; geometric and topological aspects of graph theory (05C10) Approximation algorithms (68W25)

Related Items (4)

A new algorithm for embedding plane graphs at fixed vertex locations ⋮ Multi-sided boundary labeling ⋮ Alternating paths and cycles of minimum length ⋮ Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures

This page was built for publication: Minimum Length Embedding of Planar Graphs at Fixed Vertex Locations