FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
From MaRDI portal
Publication:5897773
DOI10.1007/11590156zbMath1172.68560OpenAlexW2484051058MaRDI QIDQ5897773
Samir Datta, Sambuddha Roy, Eric W. Allender
Publication date: 14 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11590156
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Connectivity (05C40)
Related Items (7)
Connectivity check in 3-connected planar graphs with obstacles ⋮ The planar \(k\)-means problem is NP-hard ⋮ The isomorphism problem for planar 3-connected graphs is in unambiguous logspace ⋮ Deterministically isolating a perfect matching in bipartite planar graphs ⋮ The Planar k-Means Problem is NP-Hard ⋮ Planar and grid graph reachability problems ⋮ On the Complexity of Sandpile Prediction Problems
This page was built for publication: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
