Reversible Pebble Game on Trees
From MaRDI portal
Publication:3196374
DOI10.1007/978-3-319-21398-9_7zbMath1466.68044OpenAlexW1144493394MaRDI QIDQ3196374
Balagopal Komarath, Saurabh Sawlani, M. N. Jayalal Sarma
Publication date: 29 October 2015
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-21398-9_7
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Games on graphs (graph-theoretic aspects) (05C57)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Speedups of deterministic machines by synchronous parallel machines
- Separation of the monotone NC hierarchy
- The PSPACE-Completeness of Black-White Pebbling
- A polynomial algorithm for the min-cut linear arrangement of trees
- Time/Space Trade-Offs for Reversible Computation
- The Pebbling Problem is Complete in Polynomial Space
- Complete Register Allocation Problems