CONSTRUCTING DEGREE-3 SPANNERS WITH OTHER SPARSENESS PROPERTIES
From MaRDI portal
Publication:4886312
DOI10.1142/S0129054196000105zbMath0852.68100MaRDI QIDQ4886312
Gautam K. Das, Paul J. Heffernan
Publication date: 26 November 1996
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Lower Bounds on the Dilation of Plane Spanners, Lower Bounds on the Dilation of Plane Spanners, 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, Degree-bounded minimum spanning trees, There are plane spanners of degree 4 and moderate stretch factor, Lattice Spanners of Low Degree, Lattice spanners of low degree