✦ LIBER ✦

Fractional matroid matchings

✍ Scribed by John H Vande Vate

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 674 KB
Volume: 55
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(92)90037-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic matchings and quasidynamic fract

Dynamic matchings and quasidynamic fractional matchings. I

✍ James B. Orlin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 560 KB

## Abstract This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time‐expanded infinite network. The initial model is a finite directed graph __G__ = (__V, E__) in which each edge has an associated real‐valued w

Dynamic matchings and quasidynamic fract

Dynamic matchings and quasidynamic fractional matchings. II

✍ James B. Orlin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 869 KB

Consider a directed graph G in which every edge has an associated real-valued distance and a real-valued weight. The weight of an undirected circuit of C is the sum of the weights of the edges, whereas the distance of an undirected circuit is the sum of the distances of the forward edges of the circ

Matchings and ▵-matroids

✍ André Bouchet 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 354 KB

Matching, matroids, and extensions

✍ William H. Cunningham 📂 Article 📅 2002 🏛 Springer-Verlag 🌐 English ⚖ 248 KB

Perfect fractional matchings in random h

Perfect fractional matchings in random hypergraphs

✍ Michael Krivelevich 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 890 KB

Given an r-uniform hypergraph H = (V, E ) on ( V ( = n vertices, a real-valued function f(e) 5 1 for all u E V and C e E E f(e) = n/r. Considering a random r-uniform hypergraph process of n vertices, we show that with probability tending to 1 as n + m , at the very moment to when the last isolated

On certain classes of fractional matchin

On certain classes of fractional matchings

✍ J.R. Mühlbacher; F.X. Steinparz; G. Tinhofer 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 560 KB