✦ LIBER ✦

The Longest Path Problem Is Polynomial on Cocomparability Graphs

✍ Scribed by Kyriaki Ioannidou, Stavros D. Nikolopoulos

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Simple Polynomial Algorithm for the Lo

✍ Mertzios, George B.; Corneil, Derek G. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 333 KB

Hamiltonian cycle is polynomial on cocom

✍ Jitender S. Deogun; George Steiner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 705 KB

The Longest Path Problem has a Polynomia

✍ Kyriaki Ioannidou; George B. Mertzios; Stavros D. Nikolopoulos 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 791 KB

Computing and counting longest paths on

✍ Mertzios, George B.; Bezáková, Ivona 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 383 KB

Computing and Counting Longest Paths on

✍ George B. Mertzios; Ivona Bezáková 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 179 KB

An improved algorithm for the longest in

✍ Tetsuya Ishizeki; Yota Otachi; Koichi Yamazaki 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 181 KB