A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
type: Item
instance of: scholarly article
title: A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs
zbMATH Open document ID: 0506.68054
DOI: 10.1016/0020-0190(83)90120-5
published in: Information Processing Letters
publication date: 1983-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 3799031
zbMATH Keywords: graph algorithm
zbMATH Keywords: parallel algorithm
author: Chee K. Yap
MaRDI profile type: Publication
full work available at URL: 0020-0190(83)90120-5
OpenAlex ID: W2072797026
cites work: Q4130999
cites work: Efficient Algorithms for Shortest Paths in Sparse Networks
description: scientific article; zbMATH DE number 3799031