The disjoint paths problem in quadratic time

2011/08/01 by Ken-ichi Kawarabayashi, Ken‐ichi Kawarabayashi, Yusuke Kobayashi +1 · 9 citations
Computer Science · Mathematics · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Limits and Structures in Graph Theory

paper · pdf · doi:10.1016/j.jctb.2011.07.004

openalex publication_date 2011/08/01 · crossref created 2011/08/01 · crossref issued 2012/03/01 · crossref published 2012/03/01 · crossref published-print 2012/03/01 · crossref deposited 2019/06/13 · openalex created_date 2025/10/10 · crossref indexed 2026/06/15 · openalex updated_date 2026/08/02

Cited by

• Well-Quasi-Ordering Eulerian Digraphs: Bounded Carving Width
• Temporal Routing in Static Networks: The Schedule Completion Problem
• Completely Independent Steiner Trees
• (Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs
• The Graph Minor Algorithm with Parity Conditions
• Graph modification of bounded size to minor-closed classes as fast as vertex deletion
• Graph minor [wikipedia]
• P versus NP problem [wikipedia]
• Robertson–Seymour theorem [wikipedia]