Calculating graph algorithms for dominance and shortest path (Q2908564)
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 6076969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Calculating graph algorithms for dominance and shortest path |
scientific article; zbMATH DE number 6076969 |
Statements
Calculating Graph Algorithms for Dominance and Shortest Path (English)
0 references
5 September 2012
0 references
graph algorithms
0 references
dominance
0 references
shortest path algorithm
0 references
fixed-point fusion
0 references
fixed-point calculus
0 references
Galois connections
0 references
0.7499914765357971
0 references
0.7121865749359131
0 references
