𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A matching algorithm for regular bipartite graphs

✍ Scribed by J. Csima; L. Lovász

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
693 KB
Volume
35
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple matching algorithm for regular
A simple matching algorithm for regular bipartite graphs
✍ Kazuhisa Makino; Takashi Takabatake; Satoru Fujishige 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 62 KB

We consider the perfect matching problem for a ∆-regular bipartite graph with n vertices and m edges, i.e., 1 2 n∆ = m, and present a new O(m + n log n log ∆) algorithm. Cole and Rizzi, respectively, gave algorithms of the same complexity as ours, Schrijver also devised an O(m∆) algorithm, and the b

The rainbow number of matchings in regul
The rainbow number of matchings in regular bipartite graphs
✍ Xueliang Li; Zhixia Xu 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 386 KB

Given a graph G and a subgraph H of G, let rb(G, H) be the minimum number r for which any edge-coloring of G with r colors has a rainbow subgraph H. The number rb(G, H) is called the rainbow number of H with respect to G. Denote as mK 2 a matching of size m and as B n,k the set of all the k-regular