✦ LIBER ✦

Minimum perfect bipartite matchings and spanning trees under categorization

✍ Scribed by Michael B. Richey; Abraham P. Punnen

Book ID: 104184295
Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 711 KB
Volume: 39
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(92)90165-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Maximum matchings in bipartite graphs vi

Maximum matchings in bipartite graphs via strong spanning trees

✍ M. L. Balinski; J. Gonzalez 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 692 KB

Finding all minimum-cost perfect matchin

Finding all minimum-cost perfect matchings in Bipartite graphs

✍ Komei Fukuda; Tomomi Matsui 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 401 KB

An asymptotic determination of the minim

An asymptotic determination of the minimum spanning tree and minimum matching constants in geometrical probability

✍ Dimitris J. Bertsimas; Garrett van Ryzin 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 491 KB

A distributed algorithm for constructing

A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks

✍ Thilmee M. Baduge; Akihito Hiromori; Hirozumi Yamaguchi; Teruo Higashino 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 787 KB

## Abstract In this paper, we propose a new protocol that constructs a spanning tree on an overlay network given by a complete graph, in a decentralized manner. This algorithm consists of two decentralized operations, which support joining of and leaving of the overlay network at any time in the se