✦ LIBER ✦

On efficient parallel computations of costs of paths on a grid graph

✍ Scribed by Wojciech Rytter

Book ID: 113163170
Publisher: Elsevier Science
Year: 1988
Tongue: English
Weight: 330 KB
Volume: 29
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(88)90031-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The parallel computation of minimum cost

The parallel computation of minimum cost paths in graphs by stream contraction

✍ V. Pan; J. Reif 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 612 KB

String graphs of k-bend paths on a grid

✍ Andrei Asinowski; Elad Cohen; Martin Charles Golumbic; Vincent Limouzy; Marina L 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 347 KB

The location of median paths on grid gra

The location of median paths on grid graphs

✍ Ronald I. Becker; Isabella Lari; Andrea Scozzari; Giovanni Storchi 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 341 KB

Edge intersection graphs of single bend

Edge intersection graphs of single bend paths on a grid

✍ Martin Charles Golumbic; Marina Lipshteyn; Michal Stern 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB

Some properties of edge intersection gra

Some properties of edge intersection graphs of single-bend paths on a grid

✍ A. Asinowski; B. Ries 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 515 KB

On the hamiltonian path graph of a graph

✍ George R. T. Hendry 📂 Article 📅 1987 🏛 John Wiley and Sons 🌐 English ⚖ 491 KB 👁 1 views

The hamiltonian path graph H(F) of a graph F is that graph having the same vertex set as F and in which two vertices u and u are adjacent if and only if F contains a hamiltonian u -u path. First, in response to a conjecture of Chartrand, Kapoor and Nordhaus, a characterization of nonhamiltonian grap