✦ LIBER ✦

An anonymous self-stabilizing algorithm for 1-maximal independent set in trees

✍ Scribed by Zhengnan Shi; Wayne Goddard; Stephen T. Hedetniemi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Self-stabilizing algorithms for minimal

✍ S.M. Hedetniemi; S.T. Hedetniemi; D.P. Jacobs; P.K. Srimani 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 551 KB

Parallel algorithms for computing maxima

✍ Hermann Jung; Kurt Mehlhorn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 726 KB

Optimal parallel algorithms for coloring

✍ G. Sajith; Sanjeev Saxena 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 474 KB

An efficient parallel algorithm for comp

✍ Elias Dahlhaus; Marek Karpinski; Pierre Kelsen 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 375 KB

An optimal time algorithm for finding a

✍ G. H. Chen; M. T. Kuo; J. P. Sheu 📂 Article 📅 1988 🏛 Springer Netherlands 🌐 English ⚖ 147 KB

Optimal parallel algorithms for coloring

✍ G. Sajith; Sanjeev Saxena 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 61 KB