Linear Kernels and Linear-Time Algorithms for Finding Large Cuts

The maximum cut problem in graphs and its generalizations are fundamental combinatorial problems. Several of these cut problems were recently shown to be fixed-parameter tractable and admit polynomial kernels when parameterized above the tight lower bound measured by the size and order of the graph....

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Algorithmica Ročník 80; číslo 9; s. 2574 - 2615
Hlavní autoři:	Etscheid, Michael, Mnich, Matthias
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	New York Springer US 01.09.2018 Springer Nature B.V
Témata:	Algorithm Analysis and Problem Complexity Algorithms Combinatorial analysis Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Informatics Kernels Lower bounds Mathematics of Computing Run time (computers) Special Issue dedicated to the 60th Birthday of Gregory Gutin Theory of Computation 68W05 68R10 Linear-time algorithms 05C85 Max-cut Kernelization
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!