Non-interfering network flows

DOI10.1007/3-540-55706-7_21zbMath1502.90034OpenAlexW1523318401MaRDI QIDQ5056145

No author found.

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

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

Related Items (2)

Chordless paths through three vertices ⋮ A linear time algorithm for the induced disjoint paths problem in planar graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Disjoint circuits of prescribed homotopies in a graph on a compact surface
• The ellipsoid method and its consequences in combinatorial optimization
• Geometric algorithms and combinatorial optimization
• Induced circuits in planar graphs
• Anti-blocking polyhedra
• Integer Rounding for Polymatroid and Branching Optimization Problems

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