Moving many pebbles in a graph is polynomial time
de Paul G. Spirakis · Publicada por primera vez en 1983
Ediciones (1)
- Moving many pebbles in a graph is polynomial time (1983)
Courant Institute of Mathematical Sciences, New York University · inglés
Más obras de Paul G. Spirakis
Buffered versus unbuffered tree networks for accessing a critical resource
1983
The effect of restrictions on relative processor speeds to differences in efficiency between synchronous and asynchronous systems
1982
