scientific article; zbMATH DE number 475595
From MaRDI portal
Publication:4273851
zbMath0791.05092MaRDI QIDQ4273851
Neil Robertson, P. D. Seymour, Alexander Schrijver, Bruce A. Reed
Publication date: 13 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Planar Disjoint-Paths Completion, Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths, Induced disjoint paths in circular-arc graphs in linear time, Rooted routing in the plane, Planar disjoint-paths completion, Irrelevant vertices for the planar disjoint paths problem, Linear time algorithms for two disjoint paths problems on directed acyclic graphs, Combing a Linkage in an Annulus, The Induced Disjoint Paths Problem, An Improved Algorithm for Finding Cycles Through Elements, The disjoint paths problem in quadratic time, A linear time algorithm for the induced disjoint paths problem in planar graphs, Algorithms for finding an induced cycle in planar graphs, Finding k Partially Disjoint Paths in a Directed Planar Graph, Finding disjoint paths in split graphs, Tight Bounds for Linkages in Planar Graphs, Induced Disjoint Paths in Claw-Free Graphs, Optimization and Recognition for K 5-minor Free Graphs in Linear Time
