Space Complexity of Optimization Problems in Planar Graphs

DOI10.1007/978-3-319-06089-7_21zbMath1407.68214OpenAlexW11284402MaRDI QIDQ5410651

Raghav Kulkarni, Samir Datta

Publication date: 16 April 2014

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06089-7_21

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Frameworks for designing in-place graph algorithms

This page was built for publication: Space Complexity of Optimization Problems in Planar Graphs