Low time complexity algorithms for path computation in Cayley graphs (Q1735699)
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: Low time complexity algorithms for path computation in Cayley graphs |
scientific article; zbMATH DE number 7044585
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Low time complexity algorithms for path computation in Cayley graphs |
scientific article; zbMATH DE number 7044585 |
Statements
Low time complexity algorithms for path computation in Cayley graphs (English)
0 references
28 March 2019
0 references
Cayley graphs
0 references
path computation
0 references
\(K\)-shortest paths
0 references
interconnection networks
0 references
0 references
0.7715821862220764
0 references
0.755718469619751
0 references
0.7491362690925598
0 references
0.7282954454421997
0 references
0.7258909344673157
0 references
