scientific article; zbMATH DE number 3353312
From MaRDI portal
Publication:5628150
zbMath0223.05108MaRDI QIDQ5628150
Publication date: 1971
Full work available at URL: https://eudml.org/doc/16457
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Length-bounded cuts: proper interval graphs and structural parameters ⋮ On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Paths of bounded length and their cuts: parameterized complexity and algorithms ⋮ A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints ⋮ On Algorithms Employing Treewidth for $L$-bounded Cut Problems ⋮ Parameterized complexity of length-bounded cuts and multicuts ⋮ Margin of victory for tournament solutions ⋮ Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms