✦ LIBER ✦

Finding Hamiltonian paths in cocomparability graphs using the bump number algorithm

✍ Scribed by Peter Damaschke; Jitender S. Deogun; Dieter Kratsch; George Steiner

Book ID: 104813759
Publisher: Springer Netherlands
Year: 1992
Tongue: English
Weight: 520 KB
Volume: 8
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf00571188

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Local search algorithms for finding the

Local search algorithms for finding the Hamiltonian completion number of line graphs

✍ Paolo Detti; Carlo Meloni; Marco Pranzo 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 409 KB

The Complexity of Finding Paths in Graph

The Complexity of Finding Paths in Graphs with Bounded Independence Number

✍ Nickelsen, Arfst; Tantau, Till 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 289 KB

Efficient Algorithms for Finding the Max

Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids

✍ Wun-Tat Chan; Francis Y.L. Chin 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 366 KB

In a rectangular grid, given two sets of nodes, S S sources and T T sinks , of size 2 Ž . each, the disjoint paths DP problem is to connect as many nodes in S S to the Ž nodes in T T using a set of ''disjoint'' paths. Both edge-disjoint and ¨ertex-disjoint . cases are considered in this paper. Note

A new algorithm for finding the shortest

A new algorithm for finding the shortest path between a specified pair of nodes in a graph of nonnegative arcs

✍ S. Jeyaratnam 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 276 KB