✦ LIBER ✦

On approximating the longest path in a graph

✍ Scribed by D. Karger; R. Motwani; G. D. S. Ramkumar

Book ID: 110547541
Publisher: Springer
Year: 1997
Tongue: English
Weight: 962 KB
Volume: 18
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf02523689

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The longest path in a random graph

✍ Miklós Ajtai; János Komlós; Endre Szemerédi 📂 Article 📅 1981 🏛 Springer-Verlag 🌐 English ⚖ 571 KB

Intersection of Longest Paths in a Graph

✍ Susanna F. de Rezende; Cristina G. Fernandes; Daniel M. Martin; Yoshiko Wakabaya 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 187 KB

Longest paths joining given vertices in

Longest paths joining given vertices in a graph

✍ H. A. Jung 📂 Article 📅 1986 🏛 Vandenhoeck & Ruprecht 🌐 German ⚖ 590 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

Longest Paths and Longest Cycles in Grap

Longest Paths and Longest Cycles in Graphs with Large Degree Sums

✍ Ingo Schiermeyer; Meike Tewes 📂 Article 📅 2002 🏛 Springer Japan 🌐 English ⚖ 139 KB

Longest paths and cycles in bipartite or

Longest paths and cycles in bipartite oriented graphs

✍ Zhang Ke Min 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 430 KB 👁 1 views

In this paper we obtain two sufficient conditions, Ore type (Theorem 1) and Dirac type (Theorem 2). on the degrees of a bipartite oriented graph for ensuring the existence of long paths and cycles. These conditions are shown to be the best possible in a sense. An oriented graph is a digraph without