✦ LIBER ✦

An O ( n log n ) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees

✍ Scribed by Cole, Richard; Farach-Colton, Martin; Hariharan, Ramesh; Przytycka, Teresa; Thorup, Mikkel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An improved algorithm for the maximum ag

✍ Chuan-Min Lee; Ling-Ju Hung; Maw-Shang Chang; Chia-Ben Shen; Chuan-Yi Tang 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 107 KB

An O(n log n log log n) parallel maximum

✍ Taenam Kim; Kyung-Yong Chwa 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 170 KB

An O(n log n) algorithm for suboptimal r

✍ Hwang, F. 📂 Article 📅 1979 🏛 IEEE ⚖ 324 KB

An O(n log n + m log log n) maximum weig

✍ Wei-Kuan Shih; Wen-Lian Hsu 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 852 KB

An O(n log n) algorithm for a maxmin loc

✍ C.Pandu Rangan; Ramesh Govindan 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 257 KB

An O(n log n) algorithm for the convex b

✍ G. Gallo 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 197 KB