Kernel(s) for Problems With No Kernel: On Out-Trees With Many Leaves

Συγγραφείς: Daniel Binkele-raible, Henning Fernau, FEDOR V. FOMIN, Daniel Lokshtanov, SAKET SAURABH, YNGVE VILLANGER

Συνεισφορές: The Pennsylvania State University CiteSeerX Archives

Πηγή: http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf.

Θεματικοί όροι: Categories and Subject Descriptors, F.2.2 [Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems—Computations on discrete structures General Terms, Algorithms, Theory Additional Key Words and Phrases, Kernelization, Lower Bounds, Max-Leaf Spanning Tree, Out-Branching, Parameterized Algorithms ACM Reference Format

Περιγραφή αρχείου: application/pdf

Relation: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7957; http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf

Διαθεσιμότητα: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.298.7957
http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf