Solving the weighted k-separator problem in graphs with specific modules

MaRDI QIDQ4961733zbMATH OpenFDO

Authors V. V. Lepin

Publication date 25 October 2018

Full work available at URL http://mathnet.ru/eng/timb260

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Programming involving graphs or networks (90C35)

Recommendations

• The k-separator problem
• The k-separator problem: polyhedra, complexity and approximation results
• On the maximum weight minimal separator
• On the maximum weight minimal separator
• Separators in graphs with negative and multiple vertex weights

Cites work

• scientific article; zbMATH DE number 1456953 (Why is no real title available?)
• scientific article; zbMATH DE number 2192124 (Why is no real title available?)
• scientific article; zbMATH DE number 3414349 (Why is no real title available?)
• Modular decomposition and transitive orientation
• Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations
• The k-separator problem
• The k-separator problem: polyhedra, complexity and approximation results
• The Recognition of Series Parallel Digraphs
• Transitiv orientierbare Graphen

Cited in

(3)

• The k-separator problem: polyhedra, complexity and approximation results
• The k-separator problem
• The weighted k-path vertex cover problem on series-parallel graphs

This page was built for publication: Solving the weighted \(k\)-separator problem in graphs with specific modules

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