✦ LIBER ✦

A linear algorithm for the group path problem on chordal graphs

✍ Scribed by Srinivasa R. Arikati; Uri N. Peled

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 361 KB
Volume: 44
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(93)90230-l

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A simple linear time algorithm for the d

A simple linear time algorithm for the domatic partition problem on strongly chordal graphs

✍ Shen-Lung Peng; Maw-Shang Chang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 355 KB

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

Polynomial algorithms for the weighted p

Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs

✍ Maw-Shang Chang; Yi-Chang Liu 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 475 KB

A polynomial algorithm for the parity pa

A polynomial algorithm for the parity path problem on perfectly orientable graphs

✍ Srinivasa R. Arikati; Uri N. Peled 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 993 KB

A linear time algorithm for the maximum

A linear time algorithm for the maximum capacity path problem

✍ Abraham P. Punnen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 219 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