Friday, 10:30 - 10:55 h, Room: H 3008


Erik Jan van Leeuwen
Domination when the stars are out - Efficient decomposition of claw-free graphs

Coauthors: Danny Hermelin, Matthias Mnich, Gerhard Woeginger


We algorithmize the recent structural characterization for claw-free graphs by Chudnovsky and Seymour. Building on this result, we show that several domination problems are fixed-parameter tractable, and even possess polynomial-sized kernels, on claw-free graphs. To complement these results, we establish these problems are not fixed-parameter tractable on the slightly larger class of graphs that exclude K1,4 as an induced subgraph. Our results provide a dichotomy for K1,L-free graphs and characterize when the problems are fixed-parameter tractable.


Talk 1 of the invited session Fri.1.H 3008
"Algorithms in claw-free graphs" [...]
Cluster 2
"Combinatorial optimization" [...]


  Payday Loans In Michigan. In this section we give only a brief summary recommendation for admission of Levitra Sale. Full information can be found in the instructions for receiving medications with vardenafil.