✦ LIBER ✦

A linear time algorithm for the maximum matching problem on cographs

✍ Scribed by Ming-Shing Yu; Cheng-Hsing Yang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-time algorithm for the k-fixed-

✍ Katerina Asdre; Stavros D. Nikolopoulos 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 208 KB 👁 1 views

A linear time algorithm for the maximum

✍ Abraham P. Punnen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 219 KB

A linear time algorithm for maximum matc

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

A time-optimal solution for the path cov

✍ Koji Nakano; Stephan Olariu; Albert Y. Zomaya 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 230 KB

Efficient labelling algorithms for the m

✍ Federico Malucelli; Thomas Ottmann; Daniele Pretolani 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 336 KB

A maximum stable matching for the roomma

✍ Jimmy J. M. Tan 📂 Article 📅 1990 🏛 Springer Netherlands 🌐 English ⚖ 704 KB