Multi-terminal maximum flows in node-capacitated networks

DOI10.1016/0166-218X(86)90079-XzbMath0607.90030OpenAlexW4213064273MaRDI QIDQ1085773

Refael Hassin, Frieda Granot

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90079-x

zbMATH Keywords

undirected networkcommunication and transportation networksgeneral node- and arc-capacited casemulti-terminal maximum flows

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Related Items (12)

An algorithm for computing maximum solution bases ⋮ Designing FPT Algorithms for Cut Problems Using Randomized Contractions ⋮ The optimal partitioning of networks ⋮ Generalizing the all-pairs min cut problem ⋮ Flow trees for vertex-capacitated networks ⋮ An algorithm for finding all thek-components of a digraph ⋮ Multiterminal xcut problems ⋮ Maximum concurrent flows and minimum cuts ⋮ Extracting maximal information about sets of minimum cuts ⋮ Unnamed Item ⋮ Optimal flow and capacity allocation in multiple joint quickest paths of directed networks ⋮ Flow in planar graphs with vertex capacities

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Multi-Terminal Network Flows

This page was built for publication: Multi-terminal maximum flows in node-capacitated networks