✦ LIBER ✦

An -time certifying algorithm for recognizing HHD-free graphs

✍ Scribed by Stavros D. Nikolopoulos; Leonidas Palios

Book ID: 116907387
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 434 KB
Volume: 452
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.06.006

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n3)-Time Recognition Algorithm for

An O(n3)-Time Recognition Algorithm for hhds-free Graphs

✍ Elaine M. Eschen; Chính T. Hoàng; R. Sritharan 📂 Article 📅 2007 🏛 Springer Japan 🌐 English ⚖ 217 KB

Certifying Algorithms for Recognizing In

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

✍ Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P. 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 275 KB

Certifying Algorithms for Recognizing In

Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs

✍ Kratsch, Dieter; McConnell, Ross M.; Mehlhorn, Kurt; Spinrad, Jeremy P. 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 275 KB

An efficient certifying algorithm for th

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

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

Dynamic-Programming Algorithms for Recog

Dynamic-Programming Algorithms for Recognizing Small-Bandwidth Graphs in Polynomial Time

✍ Saxe, James B. 📂 Article 📅 1980 🏛 Society for Industrial and Applied Mathematics ⚖ 970 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