The complexity of Domination Games

Sebastian Ordyniak

Description

The complexity of Domination Games Sebastian Ordyniak joint work with Stephan Kreutzer Oxford University Computing Laboratory WG 2009 Montpellier, June 25, 2009

• introduction graph


• triple free


• give lower bounds


• domination games


• provide intuitive definition


• searching games


• games played

Sujets

• Target
• Kreutzer
• Games played

Informations

• Publié par: pefav
• Nombre de lectures: 18
• Langue: English

Extrait

The

complexity of Domination Games

Sebastian Ordyniak joint work with Stephan Kreutzer

Oxford University Computing Laboratory

WG 2009 Montpellier, June 25, 2009

I N G IOPHRARONTCTDUSEO DG GMAHCNIE S RAS R OB G AMETIONMINAA G LLAHSRA M DNAREBSME MO D KAINYDR O NAITSNDHARCEAN S IOATIN S EBA M DRAHSLAO R BBRENA 24

Domination Games

Variant of graph searching introduced inFominKratschMüller'03, where it was shown that:

• Domination Games generalisecops and robber games (path-width and tree-width) • Domination Games are not monotone • close resemblence toDomination Target Number • give lower bounds for the domination search number on various classes of graphs (such ask-dimensional cubes, asteroidal-triple free graphs, claw-free graphs and graphs with certain types of spanning trees and caterpillars)

L G AMES 2/

K D OMYNIAN O RDSTIAAHDNAECROI S NNITAALSHARD M ANERBB R O

• generaliseRobber and Marshall Game(hypertree-width) • have arbitrary monotonicity costs • arePSPACE-complete • are notFPTmost variants of Domination Games are not, in fact even inXP

Here we will show that Domination Games

Domination Games

42/3 SEMA G LABE S G NARTCOIRAHCHPE S RODU I NT M ARSHALL G AMESA G NO R SEMEBBODNARG G INESAMMI D OTINA

Graph Searching Games

424/ ESAML G ALSHARD M AITSDR O NABE S S O R BBRENAAECRAHDNINATION S YNIAK D OM TCOIORUDHPE SG NARING G ARCH D OMIAMESA G NOITANEBBO R SEMRS M ANDRAME G ALLHANT I