✦ LIBER ✦

Efficient systolic algorithm for finding bridges in a connected graph

✍ Scribed by M Zubair; B.B Madan

Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 472 KB
Volume: 6
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(88)90005-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fully-pipelined systolic algorithm for

A fully-pipelined systolic algorithm for finding bridges on an undirected connected graph

✍ Su-Chu Hsu; Hsien-Fen Hsieh; Shing-Tsaan Huang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 905 KB

A local algorithm for finding the bicomp

A local algorithm for finding the bicomponents in a flow graph

✍ V.A. Evstigneev 📂 Article 📅 1978 🏛 Elsevier Science ⚖ 368 KB

A recursive algorithm for finding reliab

A recursive algorithm for finding reliability measures related to the connection of nodes in a graph

✍ J. A. Buzacott 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 763 KB

An Efficient Parallel Algorithm for Find

An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs

✍ M. Furer; B. Raghavachari 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 763 KB

A Faster Algorithm for Finding the Minim

A Faster Algorithm for Finding the Minimum Cut in a Directed Graph

✍ J.X. Hao; J.B. Orlin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 995 KB

We consider the problem of finding the minimum capacity cut in a directed network \(G\) with \(n\) nodes. This problem has applications to network reliability and survivability and is useful in subroutines for other network optimization problems. One can use a maximum flow problem to find a minimum

An algorithm for finding a short closed

An algorithm for finding a short closed spanning walk in a graph

✍ K. Takamizawa; T. Nishizeki; N. Saito 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 653 KB