### 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 k^{O(dk)}n time algorithm for finding a dominating 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 K_{h} as a topological minor, we give an improved algorithm for the problem with running time (O(h))^{hk}n. For graphs which are K_{h}-minor-free, the running time is further reduced to (O(log h))^{hk/2}n. Fixed-parameter tractable algorithms that are linear in the number of vertices of the graph were previously known only for planar graphs. For the families of graphs discussed above, the problem of finding an induced cycle of a given length is also addressed. For every fixed H and k, we show that if an H-minor-free graph G with n vertices contains an induced cycle of size k, then such a cycle can be found in O(n) expected time as well as in O(n log n) worst-case time. Some results are stated concerning the (im)possibility of establishing linear time algorithms for the more general family of degenerated graphs.

Original language | English (US) |
---|---|

Title of host publication | Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings |

Pages | 394-405 |

Number of pages | 12 |

State | Published - Dec 1 2007 |

Externally published | Yes |

Event | 13th Annual International Computing and Combinatorics Conference, COCOON 2007 - Banff, Canada Duration: Jul 16 2007 → Jul 19 2007 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 4598 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Other

Other | 13th Annual International Computing and Combinatorics Conference, COCOON 2007 |
---|---|

Country | Canada |

City | Banff |

Period | 7/16/07 → 7/19/07 |

### All Science Journal Classification (ASJC) codes

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Linear time algorithms for finding a dominating set of fixed size in degenerated graphs'. Together they form a unique fingerprint.

## Cite this

*Computing and Combinatorics - 13th Annual International Conference, COCOON 2007, Proceedings*(pp. 394-405). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4598 LNCS).