DROPS

Document

DOI: 10.4230/LIPIcs.IPEC.2025.2

Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors

Authors: Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani, and Jacob Stegemann

Published in: LIPIcs, Volume 358, 20th International Symposium on Parameterized and Exact Computation (IPEC 2025)

Abstract

In the Vertex-Disjoint-Paths-With-Congestion problem, the input consists of a digraph D, an integer c and k pairs of vertices (s_i, t_i), and the task is to find a set of paths connecting each s_i to its corresponding t_i, whereas each vertex of D appears in at most c many paths. The case where c = 1 is known to be NP-complete even if k = 2 [Fortune, Hopcroft and Wyllie, 1980] on general digraphs and is W[1]-hard with respect to k (excluding the possibility of an f(k)n^O(1)-time algorithm under standard assumptions) on acyclic digraphs [Slivkins, 2010]. The proof of [Slivkins, 2010] can also be adapted to show W[1]-hardness with respect to k for every congestion c ≥ 1. We strengthen the existing hardness result by showing that the problem remains W[1]-hard for every congestion c ≥ 1 even if: (1) the input digraph D is acyclic, (2) D does not contain an acyclic (5, 5)-grid as a butterfly minor, (3) D does not contain an acyclic tournament on 9 vertices as a butterfly minor, and (4) D has ear-anonymity at most 5. Further, we also show that the edge-congestion variant of the problem remains W[1]-hard for every congestion c ≥ 1 even if: (1) the input digraph D is acyclic, (2) D has maximum undirected degree 3, (3) D does not contain an acyclic (7, 7)-wall as a weak immersion and (4) D has ear-anonymity at most 5.

Cite as

Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani, and Jacob Stegemann. Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors. In 20th International Symposium on Parameterized and Exact Computation (IPEC 2025). Leibniz International Proceedings in Informatics (LIPIcs), Volume 358, pp. 2:1-2:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025)

Copy BibTex To Clipboard

@InProceedings{kawarabayashi_et_al:LIPIcs.IPEC.2025.2,
  author =	{Kawarabayashi, Ken-ichi and Lorenz, Nicola and Garlet Milani, Marcelo and Stegemann, Jacob},
  title =	{{Directed Disjoint Paths Remains W\lbrack1\rbrack-Hard on Acyclic Digraphs Without Large Grid Minors}},
  booktitle =	{20th International Symposium on Parameterized and Exact Computation (IPEC 2025)},
  pages =	{2:1--2:17},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-407-9},
  ISSN =	{1868-8969},
  year =	{2025},
  volume =	{358},
  editor =	{Agrawal, Akanksha and van Leeuwen, Erik Jan},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2025.2},
  URN =		{urn:nbn:de:0030-drops-251347},
  doi =		{10.4230/LIPIcs.IPEC.2025.2},
  annote =	{Keywords: digraphs, parameterized complexity, disjoint paths, butterfly minors, immersions, ear anonymity}
}

Document

DOI: 10.4230/LIPIcs.IPEC.2020.13

A Polynomial Kernel for Funnel Arc Deletion Set

Authors: Marcelo Garlet Milani

Published in: LIPIcs, Volume 180, 15th International Symposium on Parameterized and Exact Computation (IPEC 2020)

Abstract

In Directed Feedback Arc Set (DFAS) we search for a set of at most k arcs which intersect every cycle in the input digraph. It is a well-known open problem in parameterized complexity to decide if DFAS admits a kernel of polynomial size. We consider 𝒞-Arc Deletion Set (𝒞-ADS), a variant of DFAS where we want to remove at most k arcs from the input digraph in order to turn it into a digraph of a class 𝒞. In this work, we choose 𝒞 to be the class of funnels. Funnel-ADS is NP-hard even if the input is a DAG, but is fixed-parameter tractable with respect to k. So far no polynomial kernel for this problem was known. Our main result is a kernel for Funnel-ADS with 𝒪(k⁶) many vertices and 𝒪(k⁷) many arcs, computable in 𝒪(nm) time, where n is the number of vertices and m the number of arcs of the input digraph.

Cite as

Marcelo Garlet Milani. A Polynomial Kernel for Funnel Arc Deletion Set. In 15th International Symposium on Parameterized and Exact Computation (IPEC 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 180, pp. 13:1-13:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{garletmilani:LIPIcs.IPEC.2020.13,
  author =	{Garlet Milani, Marcelo},
  title =	{{A Polynomial Kernel for Funnel Arc Deletion Set}},
  booktitle =	{15th International Symposium on Parameterized and Exact Computation (IPEC 2020)},
  pages =	{13:1--13:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-172-6},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{180},
  editor =	{Cao, Yixin and Pilipczuk, Marcin},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.IPEC.2020.13},
  URN =		{urn:nbn:de:0030-drops-133163},
  doi =		{10.4230/LIPIcs.IPEC.2020.13},
  annote =	{Keywords: graph editing, directed feedback arc set, parameterized algorithm, kernels, funnels}
}

Search Results

Documents authored by Garlet Milani, Marcelo

Directed Disjoint Paths Remains W[1]-Hard on Acyclic Digraphs Without Large Grid Minors

Abstract

Cite as

A Polynomial Kernel for Funnel Arc Deletion Set

Abstract

Cite as

Thanks for your feedback!

Could not send message