Short coverings and matching in weighted graphs

DOI10.1016/J.ENDM.2011.05.055zbMath1268.05221OpenAlexW2048240456MaRDI QIDQ2840730

Anderson Novaes Martinhão, Emerson L. Monte Carmelo

Publication date: 23 July 2013

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2011.05.055

zbMATH Keywords

coveringmatchingfinite fieldweighted graph\(\omega\)-partition

Mathematics Subject Classification ID

Applications of graph theory (05C90) Other combinatorial number theory (11B75) Transversal (matching) theory (05D15)

Related Items (1)

Short covering codes arising from matchings in weighted graphs

Cites Work

• Extremal problems on sum-free sets and coverings in tridimensional spaces
• Efficient algorithms for variants of weighted matching and assignment problems
• Bounds for short covering codes and reactive tabu search
• A Combinatorial Problem in Matching
• Unnamed Item
• Unnamed Item

This page was built for publication: Short coverings and matching in weighted graphs