Non-interfering network flows

DOI10.1007/3-540-55706-7_21zbMath1502.90034MaRDI 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

68W40: Analysis of algorithms

68R10: Graph theory (including graph drawing) in computer science

90B10: Deterministic network models in operations research

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

Related Items

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