On efficient parallel computations of costs of paths on a grid graph
From MaRDI portal
Publication:1824395
DOI10.1016/0020-0190(88)90031-2zbMath0682.68061OpenAlexW86786547MaRDI QIDQ1824395
Publication date: 1988
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(88)90031-2
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (6)
Fast parallel recognition of LR language suffixes ⋮ Almost optimal sublinear time parallel recognition algorithms for three subclasses of context free languages ⋮ Efficient sublinear time parallel algorithms for dynamic programming and context-free recognition ⋮ Parallel recognition and ranking of context-free languages ⋮ Context-free recognition via shortest paths computation: a version of Valiant's algorithm ⋮ On the parallel recognition of unambiguous context-free languages
Cites Work
This page was built for publication: On efficient parallel computations of costs of paths on a grid graph