Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points

DOI10.1007/978-3-642-29344-3_22zbMath1353.68279arXiv1112.3523OpenAlexW1573166623MaRDI QIDQ2894470

Oscar Morales-Ponce, Ladislav Stacho, Stefan Dobrev, Danny Krizanc, Evangelos Kranakis

Publication date: 29 June 2012

Published in: LATIN 2012: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.3523

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Minimum Weight Connectivity Augmentation for Planar Straight-Line Graphs ⋮ Minimum weight connectivity augmentation for planar straight-line graphs ⋮ Geometric biplane graphs. II: Graph augmentation

This page was built for publication: Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points