Minimum Covers of Fixed Cardinality in Weighted Graphs

DOI10.1137/0121014zbMath0217.31203OpenAlexW2044848207MaRDI QIDQ5621380

Lee J. White

Publication date: 1971

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0121014

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (8)

Matroids and a forest cover problem ⋮ Forest covers and a polyhedral intersection theorem ⋮ Edge covering problem under hybrid uncertain environments ⋮ System of unbiased representatives for a collection of bicolorings ⋮ A linear algorithm to determine minimal spanning forests in chain graphs ⋮ An efficient algorithm for minimumk-covers in weighted graphs ⋮ An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints ⋮ Fuzzy minimum weight edge covering problem

This page was built for publication: Minimum Covers of Fixed Cardinality in Weighted Graphs