scientific article; zbMATH DE number 910923

MaRDI QIDQ4886100zbMATH OpenFDO

Authors Torben Hagerup, Jyrki Katajainen, N. Nishimura, Prabhakar Ragde

Publication date 22 August 1996

zbMATH Keywords

flow networkparallel algorithm

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Analysis of algorithms and problem complexity (68Q25) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• Characterizing multiterminal flow networks and computing flows in networks of small treewidth
• Characterizing the flow equivalent trees of a network
• scientific article; zbMATH DE number 3848941
• Flow trees for vertex-capacitated networks
• scientific article; zbMATH DE number 6861995
• scientific article; zbMATH DE number 3904297
• Quickest cluster flow problems on tree networks
• On the K best integer network flows
• A note on \(K\) best network flows
• Optimal flow trees for networks with general nonlinear arc costs

Cited in

(8)

• A decomposition algorithm for multi-terminal network flows
• Characterizing multiterminal flow networks and computing flows in networks of small treewidth
• A note on integral generalized flows in directed partial 2-trees
• On mimicking networks representing minimum terminal cuts
• scientific article; zbMATH DE number 2079418 (Why is no real title available?)
• Parallel algorithms with optimal speedup for bounded treewidth
• Faster algorithms for shortest path and network flow based on graph decomposition
• Maximum \(k\)-splittable \(s, t\)-flows

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 Q4886100)