✦ LIBER ✦

Computing and counting longest paths on circular-arc graphs in polynomial time

✍ Scribed by Mertzios, George B.; Bezáková, Ivona

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing and Counting Longest Paths on

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

Polynomial time algorithms on circular-a

✍ Toshinobu Kashiwabara; Sumio Masuda; Kazuo Nakajima; Toshio Fujisawa 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 417 KB

Computing clique and chromatic number of

✍ Pêcher, Arnaud; Wagler, Annegret K. 📂 Article 📅 2012 🏛 Springer-Verlag 🌐 English ⚖ 196 KB