Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors

Documenti analoghi

• Edge-Disjoint Paths in Eulerian Digraphs
  di: Cavallaro, Dario, et al.
  Pubblicazione: (2024)
• Direct Product Primality Testing of Graphs is GI-hard
  di: Calderoni, Luca, et al.
  Pubblicazione: (2020)
• Minimizing the Weighted Number of Tardy Jobs is W[1]-hard
  di: Heeger, Klaus, et al.
  Pubblicazione: (2024)
• An analogue of Reed's conjecture for digraphs
  di: Kawarabayashi, Ken-ichi, et al.
  Pubblicazione: (2024)
• Walking through Doors is Hard, even without Staircases: Universality and PSPACE-hardness of Planar Door Gadgets
  di: MIT Gadgets Group, et al.
  Pubblicazione: (2020)