scientific article; zbMATH DE number 2086390
From MaRDI portal
Publication:4736844
zbMath1054.68104MaRDI QIDQ4736844
Michael Soss, Pat Morin, Stefan Langerman
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850250.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10)
Related Items
Algorithms for graphs of bounded treewidth via orthogonal range searching ⋮ Connect the Dot: Computing Feed-Links with Minimum Dilation ⋮ On the geometric dilation of closed curves, graphs, and point sets ⋮ Minimum dilation stars ⋮ Geometric dilation of closed planar curves: New lower bounds ⋮ Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\) ⋮ Dilation-Optimal Edge Deletion in Polygonal Cycles ⋮ Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D