✦ LIBER ✦

Practical Performance of Efficient Minimum Cut Algorithms

✍ Scribed by M. Jünger; G. Rinaldi; S. Thienel

Publisher: Springer
Year: 2000
Tongue: English
Weight: 544 KB
Volume: 26
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s004539910009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Implementing an efficient minimum capaci

Implementing an efficient minimum capacity cut algorithm

✍ Hiroshi Nagamochi; Tadashi Ono; Toshihide Ibaraki 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 900 KB

An efficient algorithm for the minimum c

An efficient algorithm for the minimum capacity cut problem

✍ M. Padberg; G. Rinaldi 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 757 KB

Minimum and Worst-Case Performance Ratio

Minimum and Worst-Case Performance Ratios of Rollout Algorithms

✍ Luca Bertazzi 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 638 KB

Improving the efficiency of parallel min

Improving the efficiency of parallel minimum spanning tree algorithms

✍ Ka Wong Chong; Yijie Han; Yoshihide Igarashi; Tak Wah Lam 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 203 KB

This paper presents results which improve the e ciency of parallel algorithms for computing the minimum spanning trees. For an input graph with n vertices and m edges our EREW PRAM algorithm runs in O(log n) time with O((m+n) log n) operations. Our CRCW PRAM algorithm runs in O(log n) time with O((m

Estimation of the efficiency of an absol

Estimation of the efficiency of an absolute-minimum-finding algorithm

✍ Yu.M. Danilin 📂 Article 📅 1971 🏛 Elsevier Science ⚖ 389 KB

Efficient algorithms for minimum weighte

Efficient algorithms for minimum weighted colouring of some classes of perfect graphs

✍ Chính T. Hoàng 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 783 KB