scientific article; zbMATH DE number 871952

MaRDI QIDQ4875227zbMATH OpenFDO

Authors Harold N. Gabow

Publication date 28 April 1996

zbMATH Keywords

network flowsperfect packingdigraphNP-completearborescencescapacity functionpreflow mincut graph

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• A faster algorithm for packing branchings in digraphs
• Packing arborescences in random digraphs
• Packing arborescences in random digraphs

Cited in

(2)

• A constant-factor approximation for directed latency in quasi-polynomial time
• A Constant-Factor Approximation for Directed Latency in Quasi-Polynomial Time

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