On multicommodity flows in planar graphs

DOI10.1002/NET.3230140204MaRDI QIDQ3340473zbMATH OpenOpenAlexFDO

Authors Refael Hassin

Publication date 1984

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230140204

zbMATH Keywords

computational proceduresdual graphfeasible flowmulticommodity flowsundirected planar graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Algorithms for multicommodity flows in planar graphs
• An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
• Planar Multicommodity Fows, Maximum Matchings and Negative Cycles
• scientific article; zbMATH DE number 16725
• On the integral plane two-commodity flow problem

Cited in

(13)

• Algorithms for routing in planar graphs
• Algorithms for multicommodity flows in planar graphs
• Fast and efficient solution of path algebra problems
• A linear-time algorithm for edge-disjoint paths in planar graphs
• Half-integral flows in a planar graph with four holes
• A heuristic solution procedure for multicommodity integer flows
• Multicommodity flows in cycle graphs
• A combinatorial algorithm for the planar multiflow problem with demands located on three holes
• scientific article; zbMATH DE number 4201996 (Why is no real title available?)
• An Efficient Algorithm for Finding Multicommodity Flows in Planar Networks
• scientific article; zbMATH DE number 16725 (Why is no real title available?)
• Rerouting planar curves and disjoint paths
• Multicommodity flows in certain planar directed networks

This page was built for publication: On multicommodity flows in planar graphs

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