scientific article; zbMATH DE number 3943526

MaRDI QIDQ3714873zbMATH OpenFDO

Authors Wolfgang Rüger

Publication date 1984

zbMATH Keywords

communication networkmaximal number of edge disjoint paths

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1062936
• scientific article; zbMATH DE number 47435
• On multiroute maximum flows in networks.
• On the disjoint paths problem
• Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

This page was built for publication:

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