✦ LIBER ✦

An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs

✍ Scribed by Ruo-Wei Hung; Maw-Shang Chang

Book ID: 113927451
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 673 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2011.06.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Efficient Algorithms for the Domination

Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs

✍ Chang, Maw-Shang 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 409 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

Efficient reduction for path problems on

Efficient reduction for path problems on circular-arc graphs

✍ Srinivasa R. Arikati; C. Pandu Rangan; Glenn K. Manacher 📂 Article 📅 1991 🏛 Springer Netherlands 🌐 English ⚖ 509 KB

An optimal algorithm for finding dominat

An optimal algorithm for finding dominating cycles in circular-arc graphs

✍ J.Mark Keil; Doug Schaefer 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 972 KB

Exact algorithms for the Hamiltonian cyc

Exact algorithms for the Hamiltonian cycle problem in planar graphs

✍ Vladimir G. Deı˘neko; Bettina Klinz; Gerhard J. Woeginger 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 167 KB

Solving the path cover problem on circul

Solving the path cover problem on circular-arc graphs by using an approximation algorithm

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