✦ LIBER ✦

Some Observations on the Longest Path Problem

✍ Scribed by S. N. Narahari Pandit

Book ID: 123684941
Publisher: INFORMS
Year: 1964
Tongue: English
Weight: 208 KB
Volume: 12
Category: Article
ISSN: 0030-364X
DOI: 10.2307/167937

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The probabilistic longest path problem

✍ Murat, C�cile; Paschos, Vangelis Th. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 141 KB

We study the probabilistic longest path problem. We propose a modification strategy adapting a solution for a deterministic instance to a solution for the probabilistic one, we compute the functional associated with this strategy, and we evaluate the complexities of computing this functional and of

The Longest Path Problem Is Polynomial o

The Longest Path Problem Is Polynomial on Cocomparability Graphs

✍ Kyriaki Ioannidou, Stavros D. Nikolopoulos 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 948 KB

The Longest Path Problem has a Polynomia

The Longest Path Problem has a Polynomial Solution on Interval Graphs

✍ Kyriaki Ioannidou; George B. Mertzios; Stavros D. Nikolopoulos 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 791 KB

On the Relation between the Traveling-Sa

On the Relation between the Traveling-Salesman and the Longest-Path Problems

✍ William W. Hardgrave and George L. Nemhauser 📂 Article 📅 1962 🏛 INFORMS 🌐 English ⚖ 577 KB

A Simple Polynomial Algorithm for the Lo

A Simple Polynomial Algorithm for the Longest Path Problem on Cocomparability Graphs

✍ Mertzios, George B.; Corneil, Derek G. 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 333 KB

An improved algorithm for the longest in

An improved algorithm for the longest induced path problem on -chordal graphs

✍ Tetsuya Ishizeki; Yota Otachi; Koichi Yamazaki 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 181 KB