𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Competitive Weighted Matching in Transversal Matroids

✍ Scribed by Nedialko B. Dimitrov; C. Greg Plaxton

Publisher
Springer
Year
2010
Tongue
English
Weight
514 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A short proof that matching matroids are
A short proof that matching matroids are transversal
✍ Eberhard Triesch πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 165 KB

We present an elementary proof of the well-known theorem of E&nor& and Fkdkerson that a matroid is a matching matroid if and only if it is transversal. Suppose G = (V, E) is a simple graph. It is well-known that match(G), the collection of all X C V which are covered by some matching in G, is the sy

Maximum vertex-weighted matching in stro
Maximum vertex-weighted matching in strongly chordal graphs
✍ Manoel B. CampΓͺlo; Sulamita Klein πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 412 KB

Given a graph G = (V, E) and a real weight for each vertex of G, the vertex-weight of a matching is defined to be the sum of the weights of the vertices covered by the matching. In this paper we present a linear time algorithm for finding a maximum vertex-weighted matching in a strongly chordal grap