✦ LIBER ✦

A linear algorithm for centering a spanning tree of a biconnected graph

✍ Scribed by K.S. Easwarakumar; C.Pandu Rangan; G.A. Cheston

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An efficient distributed algorithm for c

✍ R.F.M. Aranha; C.Pandu Rangan 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 537 KB

A linear algorithm for bipartition of bi

✍ Hitoshi Suzuki; Naomi Takahashi; Takao Nishizeki 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 343 KB

A linear time algorithm for the Bottlene

✍ Gurmeet Singh Manku 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 621 KB

A simple linear-time algorithm for the r

✍ Fillia Makedon; Dafna Sheinwald; Yaron Wolfsthal 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 382 KB

A linear algorithm for finding the k-bro

✍ Hovhannes A. Harutyunyan; Arthur L. Liestman; Bin Shao 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 114 KB

A fast and simple algorithm for the bott

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB