✦ LIBER ✦

A Fast Algorithm for Optimally Increasing the Edge Connectivity

✍ Scribed by Naor, Dalit; Gusfield, Dan; Martel, Charles

Book ID: 118177322
Publisher: Society for Industrial and Applied Mathematics
Year: 1997
Tongue: English
Weight: 475 KB
Volume: 26
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539792234226

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel and fast sequential algorithms

Parallel and fast sequential algorithms for undirected edge connectivity augmentation

✍ András A. Benczúr 📂 Article 📅 1999 🏛 Springer-Verlag 🌐 English ⚖ 320 KB

A Unifying Augmentation Algorithm for Tw

A Unifying Augmentation Algorithm for Two-Edge Connectivity and Biconnectivity

✍ Tsan-sheng Hsu; Ming-Yang Kao 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 158 KB

An Efficient NC Algorithm for a Sparse k

An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate

✍ Hiroshi Nagamochi; Toru Hasunuma 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 166 KB

We present an efficient algorithm for finding a sparse k-edge-connectivity certificate of a multigraph G. Our algorithm runs in O log kn log k 2 log n 2 time using O k n + m processors on an ARBITRARY CRCW PRAM, where n and m stand for the numbers of vertices in G and edges in the simplified graph o

A fast algorithm for optimal buffer inse

A fast algorithm for optimal buffer insertion

✍ Weiping Shi; Zhuo Li 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 604 KB

A fast algorithm for optimal linear inte

A fast algorithm for optimal linear interpolation

✍ Khansari, M.R.K.; Leon-Garcia, A. 📂 Article 📅 1993 🏛 IEEE 🌐 English ⚖ 349 KB

Fast Connected Components Algorithms for

Fast Connected Components Algorithms for the EREW PRAM

✍ Karger, David R.; Nisan, Noam; Parnas, Michal 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 355 KB