Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers > Exact (Exponential) Algorithms for the Dominating Set Problem
Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers |
Juraj Hromkovič; Manfred Nagl; Bernhard Westfechtel
Springer Berlin Heidelberg
Graph-Theoretic Concepts in Computer Science: 30th International Workshop, WG 2004, Bad Honnef, Germany, June 21-23, 2004, Revised Papers
Exact (Exponential) Algorithms for the Dominating Set Problem
Authors

Fedor V. Fomin; Dieter Kratsch; Gerhard J. Woeginger

ARI Id

1674219750871_3321087

Access

Not Available Free

Pages

245-256

DOI

10.1007/978-3-540-30559-0_21

Chapter URL

https://rd.springer.com/chapter/10.1007/978-3-540-30559-0_21

Table of Contents of Book
Showing 1 to 20 of 35 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
Lexicographic Breadth First Search – A Survey
Derek G. Corneil
1-19
Wireless Networking: Graph Theory Unplugged
Roger Wattenhofer
20-32
Constant Time Generation of Trees with Specified Diameter
Shin-ichi Nakano; Takeaki Uno
33-45
Treelike Comparability Graphs: Characterization, Recognition, and Applications
Sabine Cornelsen; Gabriele Di Stefano
46-57
Elegant Distance Constrained Labelings of Trees
Jiří Fiala; Petr A. Golovach; Jan Kratochvíl
58-67
Collective Tree Spanners and Routing in AT-free Related Graphs
Feodor F. Dragan; Chenyu Yan; Derek G. Corneil
68-80
On the Maximum Cardinality Search Lower Bound for Treewidth
Hans L. Bodlaender; Arie M. C. A. Koster
81-92
Fully-Dynamic Recognition Algorithm and Certificate for Directed Cographs
Christophe Crespelle; Christophe Paul
93-104
Recognizing HHD-free and Welsh-Powell Opposition Graphs
Stavros D. Nikolopoulos; Leonidas Palios
105-116
Bimodular Decomposition of Bipartite Graphs
Jean-Luc Fouquet; Michel Habib; Fabien de Montgolfier; Jean-Marie Vanherpe
117-128
Coloring a Graph Using Split Decomposition
Michaël Rao
129-141
Decremental Clique Problem
Fabrizio Grandoni; Giuseppe F. Italiano
142-153
A Symbolic Approach to the All-Pairs Shortest-Paths Problem
Daniel Sawitzki
154-167
Minimal de Bruijn Sequence in a Language with Forbidden Substrings
Eduardo Moreno; Martín Matamala
168-176
A Graph-Theoretic Generalization of the Least Common Subsumer and the Most Specific Concept in the Description Logic $\mathcal{EL}$
Franz Baader
177-188
The Computational Complexity of the Minimum Weight Processor Assignment Problem
Hajo J. Broersma; Daniel Paulusma; Gerard J. M. Smit; Frank Vlaardingerbroek; Gerhard J. Woeginger
189-200
A Stochastic Location Problem with Applications to Tele-diagnostic
Nicola Apollonio; Massimiliano Caramia; Giuseppe F. Italiano
201-213
A Robust PTAS for Maximum Weight Independent Sets in Unit Disk Graphs
Tim Nieberg; Johann Hurink; Walter Kern
214-221
Tolerance Based Algorithms for the ATSP
Boris Goldengorin; Gerard Sierksma; Marcel Turkensteen
222-234
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 35 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings