๐”– Bobbio Scriptorium
โœฆ   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

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


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
โœ Ronald I. Becker; Isabella Lari; Andrea Scozzari; Giovanni Storchi ๐Ÿ“‚ Article ๐Ÿ“… 2007 ๐Ÿ› Springer US ๐ŸŒ English โš– 341 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