scientific article; zbMATH DE number 910863
From MaRDI portal
zbMATH Open0853.68141MaRDI QIDQ4886037FDOQ4886037
Authors: Harold N. Gabow 
Publication date: 12 December 1996
Title of this publication is not available (Why is that?)
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
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)
Cited In (8)
- Computing weighted strength and applications to partitioning
- A note on optimal covering augmentation for graphic polymatroids.
- On some algorithmic aspects of hypergraphic matroids
- Fast on-line/off-line algorithms for optimal reinforcement of a network and its connections with principal partition
- Polymatroids: Construction and random algorithms
- Packing algorithms for arborescences (and spanning trees) in capacitated graphs
- Improved dynamic colouring of sparse graphs
- 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)
