Non-interfering network flows

DOI10.1007/3-540-55706-7_21MaRDI QIDQ5056145zbMATH OpenOpenAlexFDO

Authors

Publication date 9 December 2022

Published in Algorithm Theory — SWAT '92 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-55706-7_21

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Deterministic network models in operations research (90B10)

Recommendations

• Nonblocking Multirate Networks
• scientific article; zbMATH DE number 3882168
• Static flows in networks
• scientific article; zbMATH DE number 3174052
• scientific article; zbMATH DE number 863470
• scientific article; zbMATH DE number 3229051
• scientific article; zbMATH DE number 5130020
• scientific article; zbMATH DE number 4204092
• Network flow algorithms

Cites work

• Anti-blocking polyhedra
• Disjoint circuits of prescribed homotopies in a graph on a compact surface
• Geometric algorithms and combinatorial optimization
• scientific article; zbMATH DE number 4133491 (Why is no real title available?)
• scientific article; zbMATH DE number 4089320 (Why is no real title available?)
• Induced circuits in planar graphs
• Integer Rounding for Polymatroid and Branching Optimization Problems
• The ellipsoid method and its consequences in combinatorial optimization

Cited in

(7)

• Network flow based buffer planning
• Minimal blocking flow in networks
• scientific article; zbMATH DE number 4041594 (Why is no real title available?)
• A linear time algorithm for the induced disjoint paths problem in planar graphs
• On Network Interference Management
• Rerouting planar curves and disjoint paths
• Chordless paths through three vertices

This page was built for publication: Non-interfering network flows

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