scientific article; zbMATH DE number 871952

zbMATH Open0844.05076MaRDI QIDQ4875227FDOQ4875227

Harold N. Gabow

Publication date: 28 April 1996

Title of this publication is not available (Why is that?)

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)

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)