✦ LIBER ✦

Algorithm for finding cuts and loops in the graph of an electronic circuit

✍ Scribed by Yu. M. Kalnibolot-skii; V. N. Timonteev

Publisher: Springer US
Year: 1971
Tongue: English
Weight: 367 KB
Volume: 7
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068827

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An algorithm for evaluating all the mini

An algorithm for evaluating all the minimal cuts of a graph

✍ Brijendra Singh 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 190 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 the minimum ske

An algorithm for finding the minimum skeleton of a growing graph

✍ G.B. Roshchin 📂 Article 📅 1977 🏛 Elsevier Science ⚖ 325 KB

A fast algorithm for minimum weight odd

A fast algorithm for minimum weight odd circuits and cuts in planar graphs

✍ Adam N. Letchford; Nicholas A. Pearson 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 157 KB

An O(K·n4) algorithm for finding the k b

An O(K·n4) algorithm for finding the k best cuts in a network

✍ Horst Hamacher 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 205 KB

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