Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Linear Time Algorithms for Finding a Dominating Set of Fixed Size
 

Summary: Linear Time Algorithms for Finding
a Dominating Set of Fixed Size
in Degenerated Graphs
Noga Alon1,
and Shai Gutner2,
1
Schools of Mathematics and Computer Science, Tel-Aviv University,
Tel-Aviv, 69978, Israel
noga@math.tau.ac.il.
2
School of Computer Science, Tel-Aviv University, Tel-Aviv, 69978, Israel
gutner@tau.ac.il.
Abstract. There is substantial literature dealing with fixed parameter
algorithms for the dominating set problem on various families of graphs.
In this paper, we give a kO(dk)
n time algorithm for finding a dominat-
ing set of size at most k in a d-degenerated graph with n vertices. This
proves that the dominating set problem is fixed-parameter tractable for
degenerated graphs. For graphs that do not contain Kh as a topological
minor, we give an improved algorithm for the problem with running time

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics