A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs

Research output: Contribution to journalArticle

Original languageEnglish (US)
Pages (from-to)181-182
Number of pages2
JournalInformation Processing Letters
Volume16
Issue number4
DOIs
StatePublished - May 13 1983

Fingerprint

Graph Algorithms
Hybrid Algorithm
Parallel algorithms
Shortest path
Parallel Algorithms
Arc of a curve
Vertex of a graph

Keywords

  • graph algorithm
  • parallel algorithm
  • Shortest path

ASJC Scopus subject areas

  • Computational Theory and Mathematics

Cite this

A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs. / Yap, Chee.

In: Information Processing Letters, Vol. 16, No. 4, 13.05.1983, p. 181-182.

Research output: Contribution to journalArticle

@article{6def5c1e9bdb44088922d3adf5f570d3,
title = "A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs",
keywords = "graph algorithm, parallel algorithm, Shortest path",
author = "Chee Yap",
year = "1983",
month = "5",
day = "13",
doi = "10.1016/0020-0190(83)90120-5",
language = "English (US)",
volume = "16",
pages = "181--182",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "4",

}

TY - JOUR

T1 - A hybrid algorithm for the shortest path between two nodes in the presence of few negative arcs

AU - Yap, Chee

PY - 1983/5/13

Y1 - 1983/5/13

KW - graph algorithm

KW - parallel algorithm

KW - Shortest path

UR - http://www.scopus.com/inward/record.url?scp=0020748438&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0020748438&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(83)90120-5

DO - 10.1016/0020-0190(83)90120-5

M3 - Article

VL - 16

SP - 181

EP - 182

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 4

ER -