2 papers
cs.CC2025
Directed disjoint paths remains W[1]-hard on acyclic digraphs without large grid minors
Ken-ichi Kawarabayashi, Nicola Lorenz, Marcelo Garlet Milani +1
In the Vertex Disjoint Paths with Congestion problem, the input consists of a digraph , an integer and pairs of vertices , and the task is to find a set of p…
math.CO2024
The strong Nash-Williams orientation theorem for rayless graphs
Max Pitz, Jacob Stegemann
In 1960, Nash-Williams proved his strong orientation theorem that every finite graph has an orientation in which the number of directed paths between any two vertices is at least h…