Calculating Graph Algorithms for Dominance and Shortest Path (Q2908564): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-31113-0_8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2122427469 / rank | |||
Normal rank | |||
Latest revision as of 22:48, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Calculating Graph Algorithms for Dominance and Shortest Path |
scientific article |
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
