[图书][B] Fundamentals of parameterized complexity
RG Downey, MR Fellows - 2013 - Springer
Parameterized complexity/multivariate complexity algorithmics is an exciting field of modern
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
algorithm design and analysis, with a broad range of theoretical and practical aspects that …
[图书][B] Parameterized algorithms
The goal of this textbook is twofold. First, the book serves as an introduction to the field of
parameterized algorithms and complexity accessible to graduate students and advanced …
parameterized algorithms and complexity accessible to graduate students and advanced …
The directed grid theorem
K Kawarabayashi, S Kreutzer - Proceedings of the forty-seventh annual …, 2015 - dl.acm.org
The grid theorem, originally proved in 1986 by Robertson and Seymour in Graph Minors V,
is one of the most central results in the study of graph minors. It has found numerous …
is one of the most central results in the study of graph minors. It has found numerous …
The planar directed k-vertex-disjoint paths problem is fixed-parameter tractable
Given a graph G and k pairs of vertices (s 1, t 1),...,(sk, tk), the k-Vertex-Disjoint Paths
problem asks for pair wise vertex-disjoint paths P 1,..., Pk such that Pi goes from si to ti …
problem asks for pair wise vertex-disjoint paths P 1,..., Pk such that Pi goes from si to ti …
Kernel bounds for path and cycle problems
Connectivity problems like k-Path and k-Disjoint Paths relate to many important milestones
in parameterized complexity, namely the Graph Minors Project, color coding, and the recent …
in parameterized complexity, namely the Graph Minors Project, color coding, and the recent …
Linear Kernels for (Connected) Dominating Set on H-minor-free graphs
We give the first linear kernels for Dominating Set and Connected Dominating Set problems
on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time …
on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time …
Confronting intractability via parameters
RG Downey, DM Thilikos - Computer Science Review, 2011 - Elsevier
One approach to confronting computational hardness is to try to understand the contribution
of various parameters to the running time of algorithms and the complexity of computational …
of various parameters to the running time of algorithms and the complexity of computational …
[HTML][HTML] Irrelevant vertices for the planar disjoint paths problem
I Adler, SG Kolliopoulos, PK Krause… - Journal of Combinatorial …, 2017 - Elsevier
Abstract The Disjoint Paths Problem asks, given a graph G and a set of pairs of terminals (s
1, t 1),…,(sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and …
1, t 1),…,(sk, tk), whether there is a collection of k pairwise vertex-disjoint paths linking si and …
New algorithms for maximum disjoint paths based on tree-likeness
K Fleszar, M Mnich, J Spoerhase - Mathematical programming, 2018 - Springer
We study the classical NP NP-hard problems of finding maximum-size subsets from given
sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint …
sets of k terminal pairs that can be routed via edge-disjoint paths (MaxEDP) or node-disjoint …
An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem
K Kawarabayashi, Y Kobayashi… - Proceedings of the forty …, 2014 - dl.acm.org
The excluded grid theorem, originally proved by Robertson and Seymour in Graph Minors V,
is one of the most central results in the study of graph minors. It has found numerous …
is one of the most central results in the study of graph minors. It has found numerous …