The diameter of Hanoi graphs (Q844161): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.004 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2006916373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cyclic towers of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: The cyclic multi-peg Tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4949857 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of the generalised cyclic Towers of Hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The tower of Hanoi / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3758856 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Towers of Hanoi rainbow problem: Coloring the rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Tower of Hanoi with Forbidden Moves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjudicating a towers of hanoi contest† / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:00, 2 July 2024

scientific article
Language Label Description Also known as
English
The diameter of Hanoi graphs
scientific article

    Statements

    The diameter of Hanoi graphs (English)
    0 references
    0 references
    0 references
    18 January 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    algorithms
    0 references
    graph algorithms
    0 references
    tower of Hanoi
    0 references
    directed graphs
    0 references
    graph diameter
    0 references
    0 references