✦ LIBER ✦

A fast algorithm for finding the compact sets

✍ Scribed by Dejan Zivkovic

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 407 KB
Volume: 38
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(91)90092-v

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for finding interlockin

A fast algorithm for finding interlocking sets

✍ Errol L. Lloyd 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 354 KB

A fast algorithm for finding lines in pi

A fast algorithm for finding lines in pictures

✍ D. Herbison-Evans 📂 Article 📅 1981 🏛 Elsevier Science ⚖ 489 KB

Algorithm for finding minimal cut sets i

Algorithm for finding minimal cut sets in a fault tree

✍ Ladislav Rosenberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 286 KB

This paper presents several algorithms that have been used in a computer code for fault-tree analysing by the minimal cut sets method. The main algorithm is the more efficient version of the new CARA algorithm, which finds minimal cut sets with an auxiliary dynamical structure. The presented algorit

A fast algorithm for transposing large m

A fast algorithm for transposing large multidimensional image data sets

✍ Marin van Heel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 800 KB

A fast maximum finding algorithm on broa

A fast maximum finding algorithm on broadcast communication

✍ Shiau Shyue-Horng; Chang-Biau Yang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 579 KB

A sufficiently fast algorithm for findin

A sufficiently fast algorithm for finding close to optimal clique trees

✍ Ann Becker; Dan Geiger 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

We offer an algorithm that finds a clique tree such that the size of the largest clique is at most (2α + 1)k where k is the size of the largest clique in a clique tree in which this size is minimized and α is the approximation ratio of an α-approximation algorithm for the 3-way vertex cut problem. W