✦ 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
DOI: 10.1007/s100920170007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear algorithms for testing the sign s

Linear algorithms for testing the sign stability of a matrix and for findingZ-maximum matchings in acyclic graphs

✍ Victor Klee; Pauline van den Driessche 📂 Article 📅 1977 🏛 Springer-Verlag 🌐 English ⚖ 692 KB

A self-stabilizing algorithm for colorin

A self-stabilizing algorithm for coloring bipartite graphs

✍ Sumit Sur; Pradip K. Srimani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 566 KB

A self-stabilizing algorithm for colorin

A self-stabilizing algorithm for coloring planar graphs

✍ Sukumar Ghosh; Mehmet Hakan Karaata 📂 Article 📅 1993 🏛 Springer-Verlag 🌐 English ⚖ 557 KB

Algorithmic graph theory and perfect gra

Algorithmic graph theory and perfect graphs

✍ Rolf H. Möhring 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 81 KB

A Self-Stabilizing Leader Election Algor

A Self-Stabilizing Leader Election Algorithm for Tree Graphs

✍ 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

Efficient algorithms for interval graphs and circular-arc 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