scientific article; zbMATH DE number 7051285

zbMath1423.05179MaRDI QIDQ4633929

Ken-ichi Kawarabayashi, Yusuke Kobayashi

Publication date: 6 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=1496894

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (23)

Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths ⋮ Irrelevant vertices for the planar disjoint paths problem ⋮ Induced disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ Induced disjoint paths and connected subgraphs for \(H\)-free graphs ⋮ MIP formulations for induced graph optimization problems: a tutorial ⋮ Combing a Linkage in an Annulus ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ The disjoint paths problem in quadratic time ⋮ Algorithms for the edge-width of an embedded graph ⋮ Subexponential algorithms for partial cover problems ⋮ Confronting intractability via parameters ⋮ Parameterized algorithms for list \(K\)-cycle ⋮ Finding disjoint paths in split graphs ⋮ \(k\)-chordal graphs: from cops and robber to compact routing via treewidth ⋮ Few induced disjoint paths for \(H\)-free graphs ⋮ Induced Disjoint Paths in Claw-Free Graphs ⋮ Induced disjoint paths in AT-free graphs ⋮ Induced packing of odd cycles in planar graphs ⋮ Few induced disjoint paths for \(H\)-free graphs ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ A faster algorithm to recognize even-hole-free graphs

This page was built for publication: