✦ LIBER ✦

A successful algorithm for the undirected Hamiltonian path problem

✍ Scribed by Gerald L. Thompson; Sharad Singhal

Book ID: 104182884
Publisher: Elsevier Science
Year: 1985
Tongue: English
Weight: 1010 KB
Volume: 10
Category: Article
ISSN: 0166-218X
DOI: 10.1016/0166-218x(85)90011-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A successful algorithm for solving direc

A successful algorithm for solving directed Hamiltonian path problems

✍ Gerald L. Thompson; Sharad Singhal 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Inclusion and exclusion algorithm for th

Inclusion and exclusion algorithm for the Hamiltonian path problem

✍ Eric T. Bax 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 452 KB

Approximation algorithms for multiple te

Approximation algorithms for multiple terminal, Hamiltonian path problems

✍ Jungyun Bae; Sivakumar Rathinam 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 584 KB

Solving the undirected multicommodity fl

Solving the undirected multicommodity flow problem using a shortest path-based pricing algorithm

✍ Richard D. McBride; John W. Mamer 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 101 KB

A simple linear algorithm for the edge-d

A simple linear algorithm for the edge-disjoint (s, t)-paths problem in undirected planar graphs

✍ Laurent Coupry 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Let G = (v!E) be an undirected planar graph, and s, 1 E V, s # f. We present a linear algorithm to compute a set of edge-disjoint (s, t)-paths of maximum cardinality in G. In other words, the problem is to find a maximum unit flow from s to r in a non-weighted graph. The main purpose is not to show

A branch-and-cut algorithm for the Undir

A branch-and-cut algorithm for the Undirected Rural Postman Problem

✍ Gianpaolo Ghiani; Gilbert Laporte 📂 Article 📅 2000 🏛 Springer-Verlag 🌐 English ⚖ 137 KB