Exact and Parameterized Algorithms for Max Internal Spanning Tree

We consider the -hard problem of finding a spanning tree with a maximum number of internal vertices. This problem is a generalization of the famous Hamiltonian Path problem. Our dynamic-programming algorithms for general and degree-bounded graphs have running times of the form with c ≤2. For graphs...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 65; číslo 1; s. 95 - 128
Hlavní autoři:	Binkele-Raible, Daniel, Fernau, Henning, Gaspers, Serge, Liedloff, Mathieu
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer-Verlag 01.01.2013 Springer Springer Verlag
Témata:	Algorithm Analysis and Problem Complexity Algorithmics. Computability. Computer arithmetics Algorithms Applied sciences Computer Science Computer science; control theory; systems Computer Systems Organization and Communication Networks Data Structures and Algorithms Data Structures and Information Theory Exact sciences and technology Information retrieval. Graph Mathematics of Computing Programming languages Software Theoretical computing Theory of Computation Measure and conquer Parameterized algorithms Spanning tree problems Maximum internal spanning trees Exact exponential-time algorithms Branching Compilation Hamiltonian path Algorithmics Routing Identifier Spanning tree NP hard problem Exponential time Graph degree Dynamic programming Time complexity Algorithm analysis
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!