Exponential time algorithms for the minimum dominating set problem on some graph classes

Authors:
Serge Gaspers;Dieter Kratsch;Mathieu Liedloff;Ioan Todinca
Affiliations:
Universidad de Chile, Santiago, Chile;Université Paul Verlaine -- Metz, Metz Cedex, France;Université d'Orléans, Orléans Cedex, France;Université d'Orléans, Orléans Cedex, France
Venue:
ACM Transactions on Algorithms (TALG)
Year:
2009

Citing 14
Cited 3

The complexity of domination problems in circle graphs

Discrete Applied Mathematics
Approximating treewidth, pathwidth, frontsize, and shortest elimination tree

Journal of Algorithms
Meyniel weakly triangulated graphs—I: co-perfect orderability

Discrete Applied Mathematics
Treewidth for graphs with small chordality

Proceedings of the 4th Twente workshop on Graphs and combinatorial optimization
Listing all Minimal Separators of a Graph

SIAM Journal on Computing
Graph classes: a survey

Graph classes: a survey
Treewidth and Minimum Fill-in: Grouping the Minimal Separators

SIAM Journal on Computing
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Dynamic programming and fast matrix multiplication

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Finding a dominating set on bipartite graphs

Information Processing Letters
Pathwidth of cubic graphs and exact algorithms

Information Processing Letters
Measure and conquer: domination – a case study

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithmics in exponential time

STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Exact (exponential) algorithms for the dominating set problem

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

An improved approximation algorithm for spanning star forest in dense graphs

COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Improved approximation for spanning star forest in dense graphs

Journal of Combinatorial Optimization
Parameterized Domination in Circle Graphs

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

The minimum dominating set problem remains NP-hard when restricted to any of the following graph classes: c-dense graphs, chordal graphs, 4-chordal graphs, weakly chordal graphs, and circle graphs. Developing and using a general approach, for each of these graph classes we present an exponential time algorithm solving the minimum dominating set problem faster than the best known algorithm for general graphs. Our algorithms have the following running time: O(1.4124n) for chordal graphs, O(1.4776n) for weakly chordal graphs, O(1.4845n) for 4-chordal graphs, O(1.4887n) for circle graphs, and O(1.2273(1+&sqrt;1−2c)n) for c-dense graphs.