Mostra el registre d'ítem simple
Monotonicity and inert fugitive search games
dc.contributor.author | Stamatiou, Yannis |
dc.contributor.author | Thilikos Touloupas, Dimitrios |
dc.contributor.other | Universitat Politècnica de Catalunya. Departament de Ciències de la Computació |
dc.date.accessioned | 2016-11-08T10:11:34Z |
dc.date.available | 2016-11-08T10:11:34Z |
dc.date.issued | 1999-10 |
dc.identifier.citation | Stamatiou, Y., Thilikos, D. "Monotonicity and inert fugitive search games". 1999. |
dc.identifier.uri | http://hdl.handle.net/2117/93084 |
dc.description.abstract | In general, graph search can be described in terms of a sequence of searchers' moves on a graph, able to capture a fugitive resorting on its vertices/edges. Several variations of graph search have been introduced, differing on the abilities of the fugitive as well as of the search. In this paper, we examine the case where the fugitive is inert, i.e., it moves only whenever the search is about to capture it. Mainly, there are two variants for |
dc.format.extent | 21 p. |
dc.language.iso | eng |
dc.relation.ispartofseries | LSI-99-35-R |
dc.subject | Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica |
dc.subject.other | Graph search |
dc.subject.other | Edge search |
dc.subject.other | Inert node search |
dc.subject.other | Graph theoretic parameter |
dc.subject.other | Treewidth |
dc.subject.other | Monotonicity |
dc.subject.other | Search games |
dc.title | Monotonicity and inert fugitive search games |
dc.type | External research report |
dc.rights.access | Open Access |
local.identifier.drac | 1903006 |
dc.description.version | Postprint (published version) |
local.citation.author | Stamatiou, Y.; Thilikos, D. |
Fitxers d'aquest items
Aquest ítem apareix a les col·leccions següents
-
Reports de recerca [1.107]