Moving many pebbles in a graph is polynomial time

Paul G. Spirakis, Chee Yap

Research output: Book/ReportOther report

Original languageEnglish (US)
PublisherDepartment of Computer Science, New York University
StatePublished - 1983

Publication series

NameComputer Science Report
No.93

Cite this

Spirakis, P. G., & Yap, C. (1983). Moving many pebbles in a graph is polynomial time. (Computer Science Report; No. 93). Department of Computer Science, New York University.

Moving many pebbles in a graph is polynomial time. / Spirakis, Paul G.; Yap, Chee.

Department of Computer Science, New York University, 1983. (Computer Science Report; No. 93).

Research output: Book/ReportOther report

Spirakis, PG & Yap, C 1983, Moving many pebbles in a graph is polynomial time. Computer Science Report, no. 93, Department of Computer Science, New York University.
Spirakis PG, Yap C. Moving many pebbles in a graph is polynomial time. Department of Computer Science, New York University, 1983. (Computer Science Report; 93).
Spirakis, Paul G. ; Yap, Chee. / Moving many pebbles in a graph is polynomial time. Department of Computer Science, New York University, 1983. (Computer Science Report; 93).
@book{e205e8e7b59445e787de96a0b92ad316,
title = "Moving many pebbles in a graph is polynomial time",
author = "Spirakis, {Paul G.} and Chee Yap",
year = "1983",
language = "English (US)",
series = "Computer Science Report",
publisher = "Department of Computer Science, New York University",
number = "93",

}

TY - BOOK

T1 - Moving many pebbles in a graph is polynomial time

AU - Spirakis, Paul G.

AU - Yap, Chee

PY - 1983

Y1 - 1983

M3 - Other report

T3 - Computer Science Report

BT - Moving many pebbles in a graph is polynomial time

PB - Department of Computer Science, New York University

ER -