scholarly journals Distributed Dominating Set Approximations beyond Planar Graphs

2019 ◽  
Vol 15 (3) ◽  
pp. 1-18 ◽  
Author(s):  
Saeed Akhoondian Amiri ◽  
Stefan Schmid ◽  
Sebastian Siebertz
Keyword(s):  
Planar Graphs ◽  
Dominating Set

scholarly journals Refined Search Tree Technique for Dominating Set on Planar Graphs

2001 ◽  
pp. 111-123 ◽  
Author(s):  
Jochen Alber ◽  
Hongbing Fan ◽  
Michael R. Fellows ◽  
Henning Fernau ◽  
Rolf Niedermeier ◽  
...  
Keyword(s):  
Planar Graphs ◽  
Dominating Set ◽  
Search Tree

Boundary Classes of Planar Graphs

2008 ◽  
Vol 17 (2) ◽  
pp. 287-295 ◽  
Author(s):  
VADIM LOZIN
Keyword(s):  
Polynomial Time ◽  
Planar Graphs ◽  
Dominating Set ◽  
Helpful Tool ◽  
Tree Width

We analyse classes of planar graphs with respect to various properties such as polynomial-time solvability of thedominating setproblem or boundedness of the tree-width. A helpful tool to address this question is the notion of boundary classes. The main result of the paper is that for many important properties there are exactly two boundary classes of planar graphs.

Fixed Parameter Algorithms for DOMINATING SET and Related Problems on Planar Graphs

Algorithmica ◽  
2002 ◽  
Vol 33 (4) ◽  
pp. 461-493 ◽  
Author(s):  
J. Alber ◽  
H. L. Bodlaender ◽  
H. Fernau ◽  
T. Kloks ◽  
R. Niedermeier
Keyword(s):  
Planar Graphs ◽  
Dominating Set ◽  
Fixed Parameter

scholarly journals A refined search tree technique for Dominating Set on planar graphs

2005 ◽  
Vol 71 (4) ◽  
pp. 385-405 ◽  
Author(s):  
Jochen Alber ◽  
Hongbing Fan ◽  
Michael R. Fellows ◽  
Henning Fernau ◽  
Rolf Niedermeier ◽  
...  
Keyword(s):  
Planar Graphs ◽  
Dominating Set ◽  
Search Tree

Distributed Local Approximation of the Minimum k-Tuple Dominating Set in Planar Graphs

2014 ◽  
pp. 49-59
Author(s):  
Andrzej Czygrinow ◽  
Michal Hanćkowiak ◽  
Edyta Szymańska ◽  
Wojciech Wawrzyniak ◽  
Marcin Witkowski
Keyword(s):  
Planar Graphs ◽  
Dominating Set ◽  
Local Approximation

scholarly journals Linear-Time Computation of a Linear Problem Kernel for Dominating Set on Planar Graphs

2012 ◽  
pp. 194-206 ◽  
Author(s):  
René van Bevern ◽  
Sepp Hartung ◽  
Frank Kammer ◽  
Rolf Niedermeier ◽  
Mathias Weller
Keyword(s):  
Planar Graphs ◽  
Linear Problem ◽  
Linear Time ◽  
Dominating Set
Sign in / Sign up

Export Citation Format

Share Document