Negative Weight Graphs
Negative Weight Graphs is a type of directed or undirected graph in which at least one edge is assigned a negative weight, distinguishing it from non-negative weight graphs by allowing decrements in path cost.
27
Publications
1.3K
Citations
45
Authors
37
Institutions
Publications per year
2017–2026
3
Parents
27
A Note on Dijkstra's Shortest Path Algorithm
D. Barton Johnson · Journal of the ACM · 1973 · 317 citations · Full text
1–5 of 27
45
3
h-index
3
h-index
3
h-index
3
h-index
3
h-index
1–5 of 45
37
Carl von Ossietzky Universität Oldenburg
Oldenburg, Germany
4 h-index
8 publications
103 citations
Technion – Israel Institute of Technology
Haifa, Israel
3 h-index
3 publications
228 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
2 h-index
5 publications
83 citations

University of Colorado System
Boulder, United States
2 h-index
2 publications
54 citations

University of Warsaw
Warsaw, Poland
2 h-index
4 publications
108 citations
University of California, Berkeley
Berkeley, United States
2 h-index
3 publications
320 citations
Rutgers, The State University of New Jersey
New Brunswick, United States
1 h-index
1 publications
24 citations
University of Copenhagen
Copenhagen, Denmark
1 h-index
2 publications
48 citations
1–8 of 37
JACM · 2 publications · 360 citations
2
h-index
PRE · 2 publications · 23 citations
2
h-index
2 publications · 62 citations
2
h-index
1 publications · 25 citations
1
h-index
PNAS · 1 publications · 16 citations
1
h-index
1–5