𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Graphs and stability of algorithms

✍ Scribed by P. Y. Yalamov


Publisher
Springer Milan
Year
2001
Tongue
English
Weight
127 KB
Volume
38
Category
Article
ISSN
0008-0624

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


A Self-Stabilizing Leader Election Algor
✍ Gheorghe Antonoiu; Pradip K. Srimani πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 231 KB

We propose a self-stabilizing algorithm (protocol) for leader election in a tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

Efficient algorithms for interval graphs
✍ U. I. Gupta; D. T. Lee; J. Y.-T. Leung πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 476 KB

## Abstract We show that for an interval graph given in the form of a family of intervals, a maximum independent set, a minimum covering by disjoint completely connected sets or cliques, and a maximum clique can all be found in __O__(__n__ log __n__) time [__O__(__n__) time if the endpoints of the