scientific article; zbMATH DE number 6297710
From MaRDI portal
Publication:5417627
zbMath1288.05279MaRDI QIDQ5417627
Ken-ichi Kawarabayashi, Zhentao Li, Bruce A. Reed
Publication date: 22 May 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40)
Related Items (9)
Graph Minors and Parameterized Algorithm Design ⋮ Combing a Linkage in an Annulus ⋮ Tight bounds for divisible subdivisions ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ On the complexity of the flow coloring problem ⋮ Counting \(K_4\)-subdivisions ⋮ Claw-Free $t$-Perfect Graphs Can Be Recognized in Polynomial Time ⋮ Faster approximation schemes and parameterized algorithms on (odd-)\(H\)-minor-free graphs ⋮ Unnamed Item
This page was built for publication: