Recognizing Bellman–Ford-Orderable Graphs (Q3832062)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4108168
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Recognizing Bellman–Ford-Orderable Graphs |
scientific article; zbMATH DE number 4108168 |
Statements
Recognizing Bellman–Ford-Orderable Graphs (English)
0 references
1988
0 references
Bellman-Ford algorithm
0 references
directed graph
0 references
shortest path
0 references
dominator tree
0 references
0.8928679
0 references
0.8852763
0 references
0.8850596
0 references
0 references
0.8449005
0 references
0 references
0 references
