In this paper, a self-stabilizing algorithm is presented for finding biconnected components of a connected undirected graph on a distributed or network model of computation. The algorithm is resilient to transient faults, therefore, it does not require initialization. The proposed algorithm is based
โฆ LIBER โฆ
Algorithm for finding a proportional equilibrium
โ Scribed by A. P. Masyuk
- Publisher
- SP MAIK Nauka/Interperiodica
- Year
- 1994
- Tongue
- English
- Weight
- 155 KB
- Volume
- 55
- Category
- Article
- ISSN
- 0001-4346
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
A Stabilizing Algorithm for Finding Bico
โ
Mehmet Hakan Karaata
๐
Article
๐
2002
๐
Elsevier Science
๐
English
โ 209 KB
A self-stabilizing algorithm for bridge
โ
Mehmet Hakan Karaata; Pranay Chaudhuri
๐
Article
๐
1999
๐
Springer-Verlag
๐
English
โ 83 KB
A parallel algorithm for finding congrue
โ
Z.C Shih; R.C.T Lee; S.N Yang
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 646 KB
A highly parallel algorithm for track fi
โ
Mauro Dell'orso; Luciano Ristori
๐
Article
๐
1990
๐
Elsevier Science
๐
English
โ 265 KB
A saddle point finding algorithm for fun
โ
I. Clejan
๐
Article
๐
1993
๐
Elsevier Science
๐
English
โ 535 KB
We present an algorithm which can be used to find saddle points of non-linear functionals or functions with a large number of variables. The saddle points that can be found have only one unstable direction. The algorithm is tested on a "~" functional and yields the well known circular "critical drop
A fast algorithm for finding interlockin
โ
Errol L. Lloyd
๐
Article
๐
1989
๐
Elsevier Science
๐
English
โ 354 KB