On the power of white pebbles
From MaRDI portal
Publication:1180416
DOI10.1007/BF01206359zbMath0788.68044OpenAlexW2611481948MaRDI QIDQ1180416
Bala Kalyanasundaram, Georg Schnitger
Publication date: 27 June 1992
Published in: Combinatorica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01206359
Extremal problems in graph theory (05C35) Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- White pebbles help
- A comparison of two variations of a pebble game on graphs
- Storage requirements for deterministic polynomial time recognizable languages
- Relationships between nondeterministic and deterministic tape complexities
- A tight bound for black and white pebbles on the pyramid
- Asymptotically tight bounds on time-space trade-offs in a pebble game