Computing the Maximum Detour of a Plane Graph in Subquadratic Time

DOI10.1007/978-3-540-92182-0_65MaRDI QIDQ3596766zbMATH OpenOpenAlexFDO

Authors Christian Wulff-Nilsen

Publication date 29 January 2009

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://curis.ku.dk/ws/files/14664618/08-07-WULLF-NILSEN.pdf

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• Computing the maximum detour of a plane geometric graph in subquadratic time
• scientific article; zbMATH DE number 2086390
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
• scientific article; zbMATH DE number 5542484
• A fast algorithm for approximating the detour of a polygonal chain.

Cited in

(7)

• A fast algorithm for approximating the detour of a polygonal chain.
• Computing the detour and spanning ratio of paths, trees, and cycles in 2D and 3D
• Computing the maximum detour of a plane geometric graph in subquadratic time
• Spanning ratio and maximum detour of rectilinear paths in the \(L _{1}\) plane
• scientific article; zbMATH DE number 2086390 (Why is no real title available?)
• scientific article; zbMATH DE number 1875426 (Why is no real title available?)
• On the dilation spectrum of paths, cycles, and trees

This page was built for publication: Computing the Maximum Detour of a Plane Graph in Subquadratic Time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3596766)