45 Pages
English
Gain access to the library to view online
Learn more

The complexity of Domination Games

-

Gain access to the library to view online
Learn more
45 Pages
English

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


Subjects

Informations

Published by
Reads 18
Language English

Exrait

The
complexity of Domination Games
Sebastian Ordyniak joint work with Stephan Kreutzer
Oxford University Computing Laboratory
WG 2009 Montpellier, June 25, 2009
INGIOPHRARONTCTDUSEODGGMAHCNIESRASROBGAMETIONMINAAGLLAHSRAMDNAREBSMEMODKAINYDRONAITSNDHARCEANSIOATINSEBAMDRAHSLAORBBRENA24
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)
LGAMES2/
KDOMYNIANORDSTIAAHDNAECROISNNITAALSHARDMANERBBRO
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/3SEMAGLABESGNARTCOIRAHCHPESRODUINTMARSHALLGAMESAGNORSEMEBBODNARGGINESAMMIDOTINA
Graph Searching Games
424/ESAMLGALSHARDMAITSDRONABESSORBBRENAAECRAHDNINATIONSYNIAKDOMTCOIORUDHPESGNARINGGARCHDOMIAMESAGNOITANEBBORSEMRSMANDRAMEGALLHANTI