Dominating sets in planar graphs: branch-width and exponential speed-up

Authors:
Fedor V. Fomin;Dimitrios M. Thilikos
Affiliations:
Paderborn University, Germany;Universitat Politècnica de Catalunya, Spain
Venue:
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Year:
2003

Citing 11
Cited 30

Graph minors: X. obstructions to tree-decomposition

Journal of Combinatorial Theory Series B
Planar Separators

SIAM Journal on Discrete Mathematics
Graph minors. XI.: circuits on a surface

Journal of Combinatorial Theory Series B
Quickly excluding a planar graph

Journal of Combinatorial Theory Series B
Graphs with branchwidth at most three

Journal of Algorithms
Branch-width and well-quasi-ordering in matroids and graphs

Journal of Combinatorial Theory Series B
Satisfiability, Branch-Width and Tseitin Tautologies

FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Improved Parameterized Algorithms for Planar Dominating Set

MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Efficient Data Reduction for DOMINATING SET: A Linear Problem Kernel for the Planar Case

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Maximum Clique Transversals

WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation

Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time data reduction for dominating set

Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

ACM Transactions on Algorithms (TALG)
Kernels in planar digraphs

Journal of Computer and System Sciences
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
A refined search tree technique for Dominating Set on planar graphs

Journal of Computer and System Sciences
Faster fixed parameter tractable algorithms for finding feedback vertex sets

ACM Transactions on Algorithms (TALG)
Genus characterizes the complexity of certain graph problems: Some tight results

Journal of Computer and System Sciences
Dynamic programming and fast matrix multiplication

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
ROMAN DOMINATION: a parameterized perspective

International Journal of Computer Mathematics
Branchwidth of chordal graphs

Discrete Applied Mathematics
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs

Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Dynamic programming and planarity: Improved tree-decomposition based algorithms

Discrete Applied Mathematics
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
How to use planarity efficiently: new tree-decomposition based algorithms

WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Faster algorithms on branch and clique decompositions

MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Generation of graphs with bounded branchwidth

WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Efficient exact algorithms on planar graphs: exploiting sphere cut branch decompositions

ESA'05 Proceedings of the 13th annual European conference on Algorithms
New tools and simpler algorithms for branchwidth

ESA'05 Proceedings of the 13th annual European conference on Algorithms
Roman domination: a parameterized perspective

SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

GD'04 Proceedings of the 12th international conference on Graph Drawing
Exact (exponential) algorithms for the dominating set problem

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Two birds with one stone: the best of branchwidth and treewidth with one algorithm

LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Tree decompositions of graphs: Saving memory in dynamic programming

Discrete Optimization
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Graph minors theory, developed by Robertson & Seymour, provides a list of powerful theoretical results and tools. However, the wide spread opinion in Graph Algorithms community about this theory is that it is mainly of theoretical importance. The main purpose of this paper is to show how very deep min-max and duality theorems from Graph Minors can be used to obtain essential speed-up to many known algorithms on different domination problems.