Multi-terminal maximum flows in node-capacitated networks

DOI10.1016/0166-218X(86)90079-XzbMATH Open0607.90030OpenAlexW4213064273MaRDI QIDQ1085773FDOQ1085773

Authors: Frieda Granot, Refael Hassin 

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

Recommendations

• Min-cost multiflows in node-capacitated undirected networks
• On multiroute maximum flows in networks.
• scientific article; zbMATH DE number 4053314
• An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network
• Generalized parametric multi-terminal flows problem.

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cites Work

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Multi-Terminal Network Flows
• Title not available (Why is that?)
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks

Cited In (21)

• On multiroute maximum flows in networks.
• Designing FPT algorithms for cut problems using randomized contractions
• Optimal flow and capacity allocation in multiple joint quickest paths of directed networks
• Flow trees for vertex-capacitated networks
• Title not available (Why is that?)
• Extracting maximal information about sets of minimum cuts
• An Algorithm for the Maximal Multicommodity Funnel-Node Flow in an Undirected Network
• Multiterminal xcut problems
• The Maximum Integer Multiterminal Flow Problem
• The multiroute maximum flow problem revisited
• Generalizing the all-pairs min cut problem
• The maximum integer multiterminal flow problem in directed graphs
• Maximum concurrent flows and minimum cuts
• An algorithm for computing maximum solution bases
• The optimal partitioning of networks
• An algorithm for finding all thek-components of a digraph
• Flow in planar graphs with vertex capacities
• A maximum flow problem with intermediate node requirements
• Min-cost multiflows in node-capacitated undirected networks
• Optimum synthesis of discrete capacitated networks with multi-terminal commodity flow requirements
• An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems

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

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