The number of shortest paths in the \((n, k)\)-star graph (Q2931914)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The number of shortest paths in the (n, k)-star graph |
scientific article; zbMATH DE number 6374969
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The number of shortest paths in the \((n, k)\)-star graph |
scientific article; zbMATH DE number 6374969 |
Statements
The number of shortest paths in the (n, k)-star graph (English)
0 references
28 November 2014
0 references
shortest path enumeration
0 references
minimum factorization of a permutation
0 references
\((n, k)\)-star graph
0 references
parallel computing
0 references
0.9381142854690552
0 references
0.8536887168884277
0 references
0.8194073438644409
0 references
0.7705000042915344
0 references
0.7692967057228088
0 references
