Improving Vertex Cover as a Graph Parameter

Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however, the drawback of vertex cover is that bounding...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Discrete Mathematics and Theoretical Computer Science Ročník 17 no.2; číslo Discrete Algorithms; s. 77 - 100
Hlavní autor:	Ganian, Robert
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Nancy DMTCS 14.09.2015 Discrete Mathematics & Theoretical Computer Science
Témata:	[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] Analysis Computational complexity Computer Science Discrete Mathematics Graph theory Graphs Mathematics Parameter estimation parameterized complexity twin-cover vertex cover United States Twin-cover Vertex cover Parameterized Complexity
ISSN:	1365-8050, 1462-7264, 1365-8050
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!