An efficient algorithm to determine all shortest paths in Sierpiński graphs (Q406332)
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: An efficient algorithm to determine all shortest paths in Sierpiński graphs |
scientific article; zbMATH DE number 6341126
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to determine all shortest paths in Sierpiński graphs |
scientific article; zbMATH DE number 6341126 |
Statements
An efficient algorithm to determine all shortest paths in Sierpiński graphs (English)
0 references
8 September 2014
0 references
shortest path algorithm
0 references
automata
0 references
Sierpiński graphs
0 references
switching tower of Hanoi
0 references
0 references
0.90423864
0 references
0.89490926
0 references
0.89242756
0 references
0 references
0.8885544
0 references
0 references
0.88537025
0 references
