✦ LIBER ✦

Bipartite Matching in the Semi-streaming Model

✍ Scribed by Sebastian Eggert; Lasse Kliemann; Peter Munstermann; Anand Srivastav

Publisher: Springer
Year: 2011
Tongue: English
Weight: 717 KB
Volume: 63
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-011-9556-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Weighted Matching in the Semi-Streaming

Weighted Matching in the Semi-Streaming Model

✍ Mariano Zelke 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 670 KB

Maintaining bipartite matchings in the p

Maintaining bipartite matchings in the presence of failures

✍ Edwin Hsing-Mean Sha; Kenneth Steiglitz 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 1013 KB

Finding all the perfect matchings in bip

Finding all the perfect matchings in bipartite graphs

✍ K. Fukuda; T. Matsui 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 283 KB

Graph search algorithms and maximum bipa

Graph search algorithms and maximum bipartite matching algorithm on the hypercube network model

✍ Jang-Ping Sheu; Nan-Ling Kuo; Gen-Huey Chen 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 648 KB

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

The most vital edges of matching in a bi

The most vital edges of matching in a bipartite graph

✍ Chun-Nan Hung; Lih-Hsing Hsu; Ting-Yi Sung 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 373 KB