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

An efficient distributed bridge-finding algorithm

โœ Scribed by Pranay Chaudhuri

Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
759 KB
Volume
81
Category
Article
ISSN
0020-0255

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An efficient algorithm to find optimal d
An efficient algorithm to find optimal double loop networks
โœ F. Aguilรณ; M.A. Fiol ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 527 KB

The problem of finding optimal diameter double loop networks with a fixed number of vertices has been widely studied. In this work, we give an algorithmic solution of the problem by using a geometrical approach. Given a fixed number of vertices n, the general problem is to find "steps" s 1 , s z e

An Efficient Distributed Token-Based Mut
An Efficient Distributed Token-Based Mutual Exculsion Algorithm with Central Coordinator
โœ Min-You Wu; Wei Shu ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 263 KB

This algorithm is a centralized token-based algorithm. An improvement of the synchronization delay for centralized mutual exclusion in distributed systems is achieved by modifying the standard algorithm for centralized mutual exclusion by a forwarding mechanism that allows tokens to be passed direct

Efficient algorithms for finding maximum
Efficient algorithms for finding maximum cliques of an overlap graph
โœ Sumio Masuda; Kazuo Nakajima; Toshinobu Kashiwabara; Toshio Fujisawa ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 728 KB

Let F = { I , , 12,. . . , Z,,} be a finite family of closed intervals on the real line. Two intervals 4 and Ik in F are said to overlap each other if they intersect but neither one of them contains the other. A graph G = (V, E) is called an overlap graph for F if there is a one-to-one correspondenc