Solution Bases of Multiterminal Cut Problems

DOI10.1287/MOOR.13.4.535zbMATH Open0667.90034OpenAlexW2127631842MaRDI QIDQ3820346FDOQ3820346

Refael Hassin

Publication date: 1988

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.13.4.535

zbMATH Keywords

cutsundirected networkedge capacities2-commodity maxflow problemsmultiterminal problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10)

Cited In (11)

• The planar multiterminal cut problem
• Flow trees for vertex-capacitated networks
• Extracting maximal information about sets of minimum cuts
• Multiterminal xcut problems
• Multiterminal flows and cuts
• Ancestor tree for arbitrary multi-terminal cut functions
• Dynamic programming and graph optimization problems
• Generalizing the all-pairs min cut problem
• Multiroute flows: cut-trees and realizability
• Maximum concurrent flows and minimum cuts
• An algorithm for computing maximum solution bases

This page was built for publication: Solution Bases of Multiterminal Cut Problems

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