Mostra el registre d'ítem simple

dc.contributor.authorStamatiou, Yannis
dc.contributor.authorThilikos Touloupas, Dimitrios
dc.contributor.otherUniversitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.date.accessioned2016-11-08T10:11:34Z
dc.date.available2016-11-08T10:11:34Z
dc.date.issued1999-10
dc.identifier.citationStamatiou, Y., Thilikos, D. "Monotonicity and inert fugitive search games". 1999.
dc.identifier.urihttp://hdl.handle.net/2117/93084
dc.description.abstractIn 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.extent21 p.
dc.language.isoeng
dc.relation.ispartofseriesLSI-99-35-R
dc.subjectÀrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject.otherGraph search
dc.subject.otherEdge search
dc.subject.otherInert node search
dc.subject.otherGraph theoretic parameter
dc.subject.otherTreewidth
dc.subject.otherMonotonicity
dc.subject.otherSearch games
dc.titleMonotonicity and inert fugitive search games
dc.typeExternal research report
dc.rights.accessOpen Access
local.identifier.drac1903006
dc.description.versionPostprint (published version)
local.citation.authorStamatiou, Y.; Thilikos, D.


Fitxers d'aquest items

Thumbnail

Aquest ítem apareix a les col·leccions següents

Mostra el registre d'ítem simple