scientific article; zbMATH DE number 2086390
From MaRDI portal
Publication:4736844
zbMATH Open1054.68104MaRDI QIDQ4736844FDOQ4736844
Authors: Stefan Langerman, Pat Morin, Michael Soss 
Publication date: 11 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850250.htm
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 5542484
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Spanning ratio and maximum detour of rectilinear paths in the \(L _{1}\) plane
- Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
- Computing the Maximum Detour of a Plane Graph in Subquadratic Time
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)
Cited In (13)
- Dilation-Optimal Edge Deletion in Polygonal Cycles
- Minimum dilation stars
- Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
- Title not available (Why is that?)
- Computing the maximum detour of a plane geometric graph in subquadratic time
- Computing the stretch factor and maximum detour of paths, trees, and cycles in the normed space
- Computing the Maximum Detour of a Plane Graph in Subquadratic Time
- Spanning ratio and maximum detour of rectilinear paths in the \(L _{1}\) plane
- Connect the Dot: Computing Feed-Links with Minimum Dilation
- Almost all Delaunay triangulations have stretch factor greater than \(\pi /2\)
- Algorithms for graphs of bounded treewidth via orthogonal range searching
- On the geometric dilation of closed curves, graphs, and point sets
- Geometric dilation of closed planar curves: New lower bounds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4736844)
