scientific article; zbMATH DE number 910863

MaRDI QIDQ4886037zbMATH OpenFDO

Authors Harold N. Gabow

Publication date 12 December 1996

zbMATH Keywords

arboricitycoveringgraphic polymatroids

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Algorithms for Graphic Polymatroids and Parametrics-Sets
• scientific article; zbMATH DE number 56092
• A note on optimal covering augmentation for graphic polymatroids.
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• Packing algorithms for arborescences (and spanning trees) in capacitated graphs

Cited in

(8)

• Packing algorithms for arborescences (and spanning trees) in capacitated graphs
• On some algorithmic aspects of hypergraphic matroids
• Improved dynamic colouring of sparse graphs
• Computing weighted strength and applications to partitioning
• Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
• Polymatroids: Construction and random algorithms
• A note on optimal covering augmentation for graphic polymatroids.
• An insertion algorithm on multiset partitions with applications to diagram algebras

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