Computing the Maximum Detour of a Plane Graph in Subquadratic Time
From MaRDI portal
Publication:3596766
DOI10.1007/978-3-540-92182-0_65zbMath1183.90440OpenAlexW2112022949MaRDI QIDQ3596766
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
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60)
Related Items (1)
This page was built for publication: Computing the Maximum Detour of a Plane Graph in Subquadratic Time
