On Two Techniques of Combining Branching and Treewidth

Branch & Reduce and dynamic programming on graphs of bounded treewidth are among the most common and powerful techniques used in the design of moderately exponential time exact algorithms for NP hard problems. In this paper we discuss the efficiency of simple algorithms based on combinations of...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 54; číslo 2; s. 181 - 207
Hlavní autoři:	Fomin, Fedor V., Gaspers, Serge, Saurabh, Saket, Stepanov, Alexey A.
Médium:	Journal Article Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.06.2009 Springer Springer Verlag
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Combinatorics Combinatorics. Ordered structures Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Discrete Mathematics Exact sciences and technology Graph theory Information retrieval. Graph Mathematics Mathematics of Computing Sciences and techniques of general use Theoretical computing Theory of Computation Exact exponential time algorithms 3-Coloring Minimum maximal matching Weighted vertex cover Parameterized algorithms NP hard problems Minimum dominating set Treewidth Branching Dominating set Graph theory k-Weighted vertex cover Maximal Matching NP hard problem Graph degree Graph colouring Dynamic programming Graph covering Fast algorithm Counting Graph matching
ISSN:	0178-4617, 1432-0541
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!