✦ LIBER ✦

An O(n1.5) algorithm to color proper circular arcs

✍ Scribed by Wei-Kuan Shih; Wen-Lian Hsu

Publisher: Elsevier Science
Year: 1989
Tongue: English
Weight: 236 KB
Volume: 25
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(89)90011-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(qn) algorithm to q-color a proper f

An O(qn) algorithm to q-color a proper family of circular arcs

✍ Austin Teng; Alan Tucker 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 683 KB

A family of arcs on a circle is proper if no arc is properly contained within another. While general minimal arc coloring is NP-complete, Orlin et al. recently obtained on O(n') algorithm for q-coloring a proper family of arcs by modeling proper arc coloring as a shortest path problem in an associat

An O (k · n)-time algorithm for computin

An O (k · n)-time algorithm for computing the reliability of a circular consecutive-k-out-of-n:F system: F. K. Hwang. IEEE Transactions on Reliability, 42(1), 161 (1993)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 105 KB

An O(n·(log2(n))2) algorithm for computi

An O(n·(log2(n))2) algorithm for computing the reliability of k-out-of-n:G k-to-l-out-of-n:G systems: BELFORE , II. IEEE Transactions pn Reliability 44(1), 132 (March 1995)

📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 224 KB

An O (n · log(n)) algorithm to compute t

An O (n · log(n)) algorithm to compute the all-terminal reliability of (K5, K2,2,2) free networks: T. Politof, A. Satyanarayana and L. Tung. IEEE Transactions on Reliability, 41(4), 512 (1992)

📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 106 KB