DAM 2002 - PDF Preprint Papers

DAM 2002

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed DAM-2002 Paper

click to vote

DAM
2002

280views more DAM 2002»

On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem

13 years 11 months ago

Download www.fmf.uni-lj.si

It is proved that seven different approaches to the multi-peg Tower of Hanoi problem are all equivalent. Among them the classical approaches of Stewart and Frame from 1941 can be ...

Sandi Klavzar, Uros Milutinovic, Ciril Petr

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	280	On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem	claim
2	135	Matchings in colored bipartite networks	claim
3	125	Complexity of Langton's ant	claim
4	120	Connectivity and fault-tolerance of hyperdigraphs	claim
5	96	The structure of stable marriage with indifference	claim
6	91	NeST graphs	claim
7	90	k-Subdomination in graphs	claim
8	86	On enumerating all minimal solutions of feedback problems	claim
9	82	On the computational complexity of strong edge coloring	claim
10	78	Uniquely 2-list colorable graphs	claim
11	76	Block duplicate graphs and a hierarchy of chordal graphs	claim
12	76	Edge-pancyclicity of coupled graphs	claim
13	75	Cutting planes in integer and mixed integer programming	claim
14	75	On the robustness of primitive words	claim
15	72	On the bound for anonymous secret sharing schemes	claim
16	68	Greedy algorithms for tracking mobile users in special mobility graphs	claim
17	67	Optimal arrangement of data in a tree directory	claim
18	66	The incidentor coloring of multigraphs and its applications	claim
19	63	Tabu search and finite convergence	claim
20	61	Short trees in polygons	claim
21	59	A survey of very large-scale neighborhood search techniques	claim
22	58	Bounds for parametric sequence comparison	claim
23	57	Polynomial algorithms that prove an NP-Hard hypothesis implies an NP-hard conclusion	claim
24	54	Total interval numbers of complete r-partite graphs	claim
25	53	Pseudo-Boolean optimization	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers