A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs (Q1836991)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs |
scientific article; zbMATH DE number 3799031
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs |
scientific article; zbMATH DE number 3799031 |
Statements
A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs (English)
0 references
1983
0 references
graph algorithm
0 references
parallel algorithm
0 references
