Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
Three algorithms for finding the shortest path between two vertices with arbitrary labels of any fractal graph Hanoi S(k, n) and the exact estimation of the minimal distance between these vertices for the case k ≥ 3 and n ˂ k are proposed.
Słowa kluczowe
Rocznik
Tom
Strony
123--128
Opis fizyczny
Bibliogr. 3 poz.
Twórcy
autor
- Institute of Computer Science, Siedlce University of Natural Sciences and Humanities ul. 3 Maja 54, 08-110 Siedlce, Poland
Bibliografia
- [1] P.K. Stockmeyer. The Tower of Hanoi: A Bibliography, September 2005. http://www.cs.win.edu/pkstoc/biblio2.pdf
- [2] S. Novikov. About shortest paths between nodes of the graph Hanoi. Scientific Issues, Catholic University in Ruzomberok, Mathematica, II, 51-58, 2009.
- [3] A. Hinz. Shortest paths between regular states of the Tower of Hanoi. Information Sciences, 63, 173-181, 1992.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-8b564363-72af-413f-8434-f7ae567c3703