Search Results - "Parameterized Algorithms ACM Reference Format"

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

Authors: Daniel Binkele-raible Henning Fernau FEDOR V. FOMIN et al.

Contributors: Daniel Binkele-raible Henning Fernau FEDOR V. FOMIN et al.

Source: http://www.ii.uib.no/~daniello/papers/kernelsNoKernel.pdf.

Subject Terms: 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

File Description: 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

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

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms.

Authors: FOMIN, FEDOR V. LOKSHTANOV, DANIEL PANOLAN, FAHAD et al.

Source: Journal of the ACM; Sep2016, Vol. 63 Issue 4, p29-29:60, 60p

Subject Terms: MATHEMATICAL models, FAMILIES, MATROIDS, PARAMETER estimation, MATHEMATICAL programming, FOUNDATIONS of arithmetic

Kernel(s) for Problems with no Kernel: On Out-Trees with Many Leaves.

Authors: Binkele-Raible, Daniel Fernau, Henning Fomin, Fedor V. et al.

Source: ACM Transactions on Algorithms; 2012, Vol. 8 Issue 4, p1-19, 19p

Subject Terms: KERNEL (Mathematics), TREE graphs, SPANNING trees, DIRECTED graphs, ALGORITHMS, MATHEMATICAL bounds, POLYNOMIALS