scientific article; zbMATH DE number 5764892

MaRDI QIDQ3579485zbMATH OpenFDO

Authors Ken-ichi Kawarabayashi, Bruce Reed

Publication date 6 August 2010

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)

Cited in

(7)

• A Tight Lower Bound for Edge-Disjoint Paths on Planar DAGs
• The disjoint paths problem in quadratic time
• A Linear-Time Parameterized Algorithm for Node Unique Label Cover
• All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs
• Linear min-max relation between the treewidth of an \(H\)-minor-free graph and its largest grid minor
• Subexponential algorithms for partial cover problems
• Towards the graph minor theorems for directed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3579485)