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žené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 80; číslo 9; s. 2574 - 2615
Hlavní autori:	Etscheid, Michael, Mnich, Matthias
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.09.2018 Springer Nature B.V
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!