๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

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

โœ Scribed by K. Takamizawa; T. Nishizeki; N. Saito

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
653 KB
Volume
10
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A 2-Approximation Algorithm for Finding
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
โœ Vincenzo Auletta; Yefim Dinitz; Zeev Nutov; Domenico Parente ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 71 KB

The problem of finding a minimum weight k-vertex connected spanning sub-ลฝ . graph in a graph G s V, E is considered. For k G 2, this problem is known to be NP-hard. Combining properties of inclusion-minimal k-vertex connected graphs ลฝ and of k-out-connected graphs i.e., graphs which contain a vertex

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

A comparison of three algorithms for fin
A comparison of three algorithms for finding fundamental cycles in a directed graph
โœ Doris R. Ryan; Stephen Chen ๐Ÿ“‚ Article ๐Ÿ“… 1981 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 543 KB

## Abstract Given a connected directed graph and a spanning tree, we consider the problem of finding the set of fundamental cycles. In particular, for each cotree arc __i__ and tree arc __j__, we need to know whether or not __i__ and __j__ are in the same fundamental cycle, and if so, whether or no