✦ LIBER ✦

An algorithm for generating minimal cutsets of undirected graphs

✍ Scribed by Shin, Yong Yeon ;Koh, Jai Sang

Publisher: Springer-Verlag
Year: 1998
Tongue: English
Weight: 250 KB
Volume: 5
Category: Article
ISSN: 1226-0061
DOI: 10.1007/bf03008891

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Enumeration of minimal cutsets of an und

Enumeration of minimal cutsets of an undirected graph

✍ S.Hasanuddin Ahmad 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Iterative algorithms for generating mini

Iterative algorithms for generating minimal cutsets in directed graphs

✍ D. R. Shier; D. E. Whited 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 803 KB

A Flexible Algorithm for Generating All

A Flexible Algorithm for Generating All the Spanning Trees in Undirected Graphs

✍ T. Matsui 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 130 KB

An algorithm for determining the automor

An algorithm for determining the automorphism partitioning of an undirected graph

✍ D. G. Corneil 📂 Article 📅 1972 🏛 Springer Netherlands 🌐 English ⚖ 563 KB

An optimal algorithm for generating mini

An optimal algorithm for generating minimal perfect hash functions

✍ Zbigniew J. Czech; George Havas; Bohdan S. Majewski 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 645 KB

A heuristic technique for generating min

A heuristic technique for generating minimal path and cutsets of a general network

✍ Amjed M Al-Ghanim 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Reliability evaluation techniques employ a variety of tools for system modeling and calculation of reliability indices. Amongst the most popular tools are network-based algorithms founded on the concept of minimal paths and minimal cutsets. This paper presents a heuristic programming technique for d