
The authors present an algorithm that can solve the Rooted Minor Containment problem in almost-linear fixed-parameter time, which implies the existence of an n^(1+o(1))-time algorithm for deciding membership in every minor-closed class of graphs. They also obtain an Ok(m^(1+o(1)))-time algorithm for the Disjoint Paths problem.


coremsg

efficient-algorithms-for-minor-containment-and-disjoint-paths-in-almost-linear-time


Efficient Algorithms for Minor Containment and Disjoint Paths in Almost-Linear Time
