Algorithms for Graphic Polymatroids and Parametrics-Sets
From MaRDI portal
Recommendations
Cited in
(19)- An insertion algorithm on multiset partitions with applications to diagram algebras
- A note on optimal covering augmentation for graphic polymatroids.
- A linear programming approach to increasing the weight of all minimum spanning trees
- The Minimum Weight In-Tree Cover Problem
- Improving graph partitions using submodular functions.
- A faster algorithm for computing the principal sequence of partitions of a graph
- Arboricity games: the core and the nucleolus
- On some algorithmic aspects of hypergraphic matroids
- Globally rigid circuits of the direction-length rigidity matroid
- A constructive arboricity approximation scheme
- Graphic submodular function minimization: a graphic approach and applications
- A new algorithm for the intersection of a line with the independent set polytope of a matroid
- scientific article; zbMATH DE number 910863 (Why is no real title available?)
- Finding the maximum subgraph of prescribed strength
- Global rigidity of direction-length frameworks
- Network reinforcement
- Fully dynamic arboricity maintenance
- Tree-packing revisited: faster fully dynamic min-cut and arboricity
- A logarithmic approximation for polymatroid congestion games
This page was built for publication: Algorithms for Graphic Polymatroids and Parametrics-Sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4377121)