Complexity of pairwise shortest path routing in the grid (Q703544)
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 2126111
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of pairwise shortest path routing in the grid |
scientific article; zbMATH DE number 2126111 |
Statements
Complexity of pairwise shortest path routing in the grid (English)
0 references
11 January 2005
0 references
Grid networks
0 references
Fault-tolerance
0 references
Node disjoint shortest paths
0 references
Edge disjoint shortest paths
0 references
NP-completeness
0 references
0.835270881652832
0 references
0.8008238077163696
0 references
0.7970495820045471
0 references
0.7873196005821228
0 references
