𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Degrees and matchings

✍ Scribed by V Chvátal; D Hanson

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
415 KB
Volume
20
Category
Article
ISSN
0095-8956

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 pfaffians
Matchings and pfaffians
✍ K.K. Nambiar 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Pfaffian of a skew symmetric matrix obtained from an undirected graph is used to enumerate the matchings in the graph.

Matchings and ▵-matroids
Matchings and ▵-matroids
✍ André Bouchet 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 354 KB