Searching and pebbling

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Kirousis, LM en
dc.contributor.author Papadimitriou, CH en
dc.date.accessioned 2014-03-01T01:06:39Z
dc.date.available 2014-03-01T01:06:39Z
dc.date.issued 1986 en
dc.identifier.issn 0304-3975 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/9546
dc.relation.uri http://www.scopus.com/inward/record.url?eid=2-s2.0-0022874903&partnerID=40&md5=434ffc1a410742e8f4f66710160e0bad en
dc.subject layout parameters of a graph en
dc.subject pebble games en
dc.subject Searching a graph en
dc.subject vertex separator of a graph en
dc.subject.classification Computer Science, Theory & Methods en
dc.subject.other COMPUTER PROGRAMMING - Algorithms en
dc.subject.other DIRECTED ACYCLIC GRAPHS en
dc.subject.other GRAPH PEBBLING en
dc.subject.other GRAPH SEARCH en
dc.subject.other NODE SEARCHING en
dc.title Searching and pebbling en
heal.type journalArticle en
heal.language English en
heal.publicationDate 1986 en
heal.abstract We relate the search number of an undirected graph G with the minimum and maximum of the progressive pebble demands of the directed acyclic graphs obtained by orienting G. Towards this end, we introduce node-searching, a slight variant of searching, in which an edge is cleared by placing searchers on both of its endpoints. We also show that the minimum number of searchers necessary to node-search a graph equals its vertex separator plus one. © 1986. en
heal.publisher ELSEVIER SCIENCE BV en
heal.journalName Theoretical Computer Science en
dc.identifier.isi ISI:A1986G157600008 en
dc.identifier.volume 47 en
dc.identifier.issue C en
dc.identifier.spage 205 en
dc.identifier.epage 218 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record