Publication:5414582
From MaRDI portal
DOI10.4086/cjtcs.2010.008zbMath1286.68240MaRDI QIDQ5414582
Nutan Limaye, Meena Mahajan, Prajakta Nimbhorkar
Publication date: 6 May 2014
Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4086/cjtcs.2010.008
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
05C38: Paths and cycles
05C10: Planar graphs; geometric and topological aspects of graph theory
Related Items
Log-space algorithms for paths and matchings in \(k\)-trees, On the power of unambiguity in log-space, Bounded, minimal, and short representations of unit interval and unit circular-arc graphs. Chapter II: algorithms