✦ LIBER ✦

A time-optimal solution for the path cover problem on cographs

✍ Scribed by Koji Nakano; Stephan Olariu; Albert Y. Zomaya

Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 230 KB
Volume: 290
Category: Article
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(02)00068-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear-time algorithm for the k-fixed-

A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs

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

Linear algorithm for optimal path cover

Linear algorithm for optimal path cover problem on interval graphs

✍ Srinivasa Rao Arikati; C. Pandu Rangan 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Algorithms for solving the conditional c

Algorithms for solving the conditional covering problem on paths

✍ Brian J. Lunday; J. Cole Smith; Jeffrey B. Goldberg 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

On a generalized Bellman equation for th

On a generalized Bellman equation for the optimal-time problem

✍ F Mignanego; G Pieri 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 311 KB

On a class of methods for the iterationa

On a class of methods for the iterational solution of time-optimal problems

✍ A.B. Rabinovich 📂 Article 📅 1966 🏛 Elsevier Science ⚖ 894 KB

Linear-time certifying algorithms for th

Linear-time certifying algorithms for the path cover and Hamiltonian cycle problems on interval graphs

✍ Ruo-Wei Hung; Maw-Shang Chang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 252 KB

A certifying algorithm for a problem is an algorithm that provides a certificate with each answer that it produces. The certificate is an evidence that can be used to authenticate the correctness of the answer. A Hamiltonian cycle in a graph is a simple cycle in which each vertex of the graph appear