Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs
From MaRDI portal
Publication:5405032
DOI10.1007/978-3-642-54423-1_10zbMath1405.68404OpenAlexW1853166665MaRDI QIDQ5405032
Prosenjit Bose, André van Renssen
Publication date: 31 March 2014
Published in: LATIN 2014: Theoretical Informatics (Search for Journal in Brave)
Full work available at URL: https://ir.library.carleton.ca/pub/7726
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)
Related Items (3)
Truly Optimal Euclidean Spanners ⋮ On plane constrained bounded-degree spanners ⋮ Routing on the visibility graph
This page was built for publication: Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs