Last update: Thu Sep 27 02:46:57 MDT 2018
@Article{Kirousis:1986:SP,
author = "L. M. Kirousis and C. H. Papadimitriou",
title = "Searching and pebbling",
journal = j-THEOR-COMP-SCI,
volume = "47",
number = "2",
pages = "205--218",
month = "????",
year = "1986",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:29:49 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
acknowledgement = ack-nhfb,
classification = "C1140E (Game theory); C1160 (Combinatorial
mathematics); C4240 (Programming and algorithm
theory)",
corpsource = "Dept. of Comput. Sci., Nat. Tech. Univ., Athens,
Greece",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computation theory; directed acyclic graphs; game
theory; graph theory; node-searching; progressive
pebble demands; search number; undirected graph",
pubcountry = "Netherlands A08",
treatment = "T Theoretical or Mathematical",
}