Monotonicity and inert fugitive search games

Consultar RECERCAT

Per accedir als documents amb el text complet, si us plau, seguiu el següent enllaç: http://hdl.handle.net/2117/93084

dc.contributor	Universitat Politècnica de Catalunya. Departament de Ciències de la Computació
dc.contributor.author	Stamatiou, Yannis
dc.contributor.author	Thilikos Touloupas, Dimitrios
dc.date	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.language.iso	eng
dc.relation	LSI-99-35-R
dc.rights	info:eu-repo/semantics/openAccess
dc.subject	Àrees temàtiques de la UPC::Informàtica::Informàtica teòrica
dc.subject	Graph search
dc.subject	Edge search
dc.subject	Inert node search
dc.subject	Graph theoretic parameter
dc.subject	Treewidth
dc.subject	Monotonicity
dc.subject	Search games
dc.title	Monotonicity and inert fugitive search games
dc.type	info:eu-repo/semantics/publishedVersion
dc.type	info:eu-repo/semantics/report
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

Díaz Cort, Josep; Kaminski, Marcin; Thilikos Touloupas, Dimitrios

Rué Perna, Juan José; Thilikos Touloupas, Dimitrios; Velona, Vasiliki

Nishimura, Naomi; Prabhakar, Ragde; Thilikos Touloupas, Dimitrios

Nishimura, Naomi; Prabhakar, Ragde; Thilikos Touloupas, Dimitrios

Thilikos Touloupas, Dimitrios; Serna Iglesias, María José; Bodlaender, Hans L.

Coordinació

Patrocini