CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
From MaRDI portal
Publication:4886312
DOI10.1142/S0129054196000105zbMath0852.68100OpenAlexW1995350474MaRDI QIDQ4886312
Paul J. Heffernan, Gautam K. Das
Publication date: 26 November 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0129054196000105
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (11)
On plane geometric spanners: a survey and open problems ⋮ On bounded degree plane strong geometric spanners ⋮ Sparse geometric graphs with small dilation ⋮ Computing a minimum-dilation spanning tree is NP-hard ⋮ Lattice Spanners of Low Degree ⋮ Lower Bounds on the Dilation of Plane Spanners ⋮ Lower Bounds on the Dilation of Plane Spanners ⋮ Lattice spanners of low degree ⋮ Degree-bounded minimum spanning trees ⋮ A note on optimal degree-three spanners of the square lattice ⋮ There are plane spanners of degree 4 and moderate stretch factor
This page was built for publication: CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
