Algorithms for Graphic Polymatroids and Parametrics-Sets

DOI10.1006/jagm.1997.0904zbMath0895.68108OpenAlexW2110898430MaRDI QIDQ4377121

Harold N. Gabow

Publication date: 8 September 1998

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1997.0904

zbMATH Keywords

graphic polymatroids

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Parallel algorithms in computer science (68W10)

Related Items (15)

A faster algorithm for computing the principal sequence of partitions of a graph ⋮ Arboricity games: the core and the nucleolus ⋮ Global rigidity of direction-length frameworks ⋮ Improving graph partitions using submodular functions. ⋮ Graphic Submodular Function Minimization: A Graphic Approach and Applications ⋮ A logarithmic approximation for polymatroid congestion games ⋮ A Constructive Arboricity Approximation Scheme ⋮ A linear programming approach to increasing the weight of all minimum spanning trees ⋮ Globally rigid circuits of the direction-length rigidity matroid ⋮ A new algorithm for the intersection of a line with the independent set polytope of a matroid ⋮ Fully dynamic arboricity maintenance ⋮ The Minimum Weight In-Tree Cover Problem ⋮ On some algorithmic aspects of hypergraphic matroids ⋮ Network reinforcement ⋮ A note on optimal covering augmentation for graphic polymatroids.

This page was built for publication: Algorithms for Graphic Polymatroids and Parametrics-Sets