scientific article; zbMATH DE number 3353312

MaRDI QIDQ5628150zbMATH OpenFDO

Authors Jiří Adámek, Václav Koubek

Publication date 1971

Full work available at URL https://eudml.org/doc/16457

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cited in

(10)

• Parameterized complexity of length-bounded cuts and multicuts
• Margin of victory for tournament solutions
• Length-bounded cuts: proper interval graphs and structural parameters
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• Paths of bounded length and their cuts: parameterized complexity and algorithms
• On algorithms employing treewidth for L-bounded cut problems
• On polynomial-time combinatorial algorithms for maximum \(L\)-bounded flow
• A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
• scientific article; zbMATH DE number 7758343 (Why is no real title available?)
• scientific article; zbMATH DE number 7765394 (Why is no real title available?)

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 Q5628150)