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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient algorithm to determine all shortest paths in Sierpiński graphs |
scientific article |
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
