Find link

language:

Find link is a tool written by Edward Betts.

searching for Kernelization 6 found (24 total)

Maximum cut (3,125 words) [view diff] no match in snippet view article find links to article

In a graph, a maximum cut is a cut whose size is at least the size of any other cut. That is, it is a partition of the graph's vertices into two complementary

Fedor Fomin (326 words) [view diff] exact match in snippet view article find links to article

Fedor V.; Lokshtanov, Daniel; Saurabh, Saket; Zehavi, Meirav (2019). Kernelization: Theory of Parameterized Preprocessing. Cambridge University Press.

Tree kernel (555 words) [view diff] exact match in snippet view article find links to article

are working natively with kernels, or have an extension that handles kernelization. An example application is classification of sentences, such as different

European Symposium on Algorithms (604 words) [view diff] exact match in snippet view article find links to article

inversion over matroid lattice 2016 Stefan Kratsch: A randomized polynomial kernelization for Vertex Cover with a smaller parameter Thomas Bläsius, Tobias Friedrich

Michael Fellows (1,630 words) [view diff] exact match in snippet view article find links to article

ALGO/ESA and is for a series of papers on how to establish lower bounds on kernelization. The two papers and prize winners are: On problems without polynomial

Sunflower (mathematics) (2,888 words) [view diff] exact match in snippet view article

85, ISSN 0024-6107, MR 0111692 Flum, Jörg; Grohe, Martin (2006), "A Kernelization of Hitting Set", Parameterized Complexity Theory, EATCS Ser. Texts in