✦ LIBER ✦

Sequential and distributed graph coloring algorithms with performance analysis in random graph spaces

✍ Scribed by Eli Shamir; Eli Upfal

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 608 KB
Volume: 5
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(84)90003-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The sequential generation of random f-gr

The sequential generation of random f-graphs. distributions and predominant types of edge maximal f-graphs with f>;4

✍ Krystyna T. Balińska; Louis V. Quintas 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 219 KB

A grid-enabled distributed branch-and-bo

A grid-enabled distributed branch-and-bound algorithm with application on the Steiner Problem in graphs

✍ Lúcia M.A. Drummond; Eduardo Uchoa; Alexandre D. Gonçalves; Juliana M.N. Silva; 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 201 KB

This work introduces a distributed branch-and-bound algorithm to be run on computational Grids. Grids are often organized in a hierarchical fashion: clusters of processors connected via high-speed links, while the clusters themselves are geographically distant and connected through slower links. Our