𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Valuative invariants for polymatroids

✍ Scribed by Harm Derksen; Alex Fink

Book ID
108051761
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
707 KB
Volume
225
Category
Article
ISSN
0001-8708

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Discrete Polymatroids
Discrete Polymatroids
✍ JΓΌrgen Herzog; Takayuki Hibi πŸ“‚ Article πŸ“… 2002 πŸ› Springer 🌐 English βš– 207 KB
Monotonicity of polymatroids
Monotonicity of polymatroids
✍ Pujari, Arun K ;Das, Pramod Kumar πŸ“‚ Article πŸ“… 1983 πŸ› Springer-Verlag 🌐 English βš– 171 KB
Adjacency on polymatroids
Adjacency on polymatroids
✍ Donald M. Topkis πŸ“‚ Article πŸ“… 1984 πŸ› Springer-Verlag 🌐 English βš– 502 KB
Algorithms for Graphic Polymatroids and
Algorithms for Graphic Polymatroids and Parametrics-Sets
✍ Harold N Gabow πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 328 KB

We present efficient algorithms for finding the covering number, finding a base, and finding the packing number, all in graphic polymatroids. The integral covering number is the arboricity of an undirected graph; computing it is suggested as an Ε½ open problem by Gallo et al.