algorithmic construction of hamiltonians in pyramids
Download
Skip this Video
Download Presentation
Algorithmic construction of Hamiltonians in pyramids

Loading in 2 Seconds...

play fullscreen
1 / 22

Algorithmic construction of Hamiltonians in pyramids - PowerPoint PPT Presentation


  • 59 Views
  • Uploaded on

Algorithmic construction of Hamiltonians in pyramids. H. Sarbazi-Azad, M. Ould-Khaoua, L.M. Mackenzie, IPL, 80, 75-79(2001). Previous work. F. Cao, D. F. Hsu, “ Fault Tolerance Properties of Pyramid Networks ”, IEEE Trans. Comput. 48 (1999) 88-93. Connectivity, fault diameter, container.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Algorithmic construction of Hamiltonians in pyramids' - minerva-english


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
algorithmic construction of hamiltonians in pyramids

Algorithmic construction of Hamiltonians in pyramids

H. Sarbazi-Azad, M. Ould-Khaoua, L.M. Mackenzie, IPL, 80, 75-79(2001)

previous work
Previous work
  • F. Cao, D. F. Hsu, “Fault Tolerance Properties of Pyramid Networks”, IEEE Trans. Comput. 48 (1999) 88-93.
  • Connectivity, fault diameter, container
pyramid p n is not regular
Pyramid Pn is not regular
  • (P1)=3, ∆(P1)=4
  • (P2)=3, ∆(P2)=7
  • (Pn)=3, ∆(Pn)=9, for n>=3
result
result
  • Theorem 1. A Pn contains Hamiltonian paths starting with any node x  P = { Pn▲, Pn◤, Pn◣, Pn◥, Pn◢ } and lasting at any node y  P – {x}.
result cont
Result(cont.)
  • Theorem 2. A pyramid of level n, Pn, is Hamiltonian.
slide13
A. Itai, C. Papadimitriou, J. Szwarcfiter, “Hamilton Paths in grid graphs”, SIAM Journal on Computing, 11 (4) (1982) 676-686.
hamiltonian property of m m n
Hamiltonian property of M(m, n)
  • In fact, M(m, n) is bipartite.
  • M(m,n) is even-size if m*n is even.
  • Roughly speaking, for a even-sized M(m, n), there exists a hamiltonian path between any two nodes x, y iff x and y belong to a same partite set.
  • There are a few exceptions. (detail)
slide16
P1
  • 剛剛看過了
induction1
Induction
  • Case 1. x, y 都在上面 n-1層
p n is pancyclic
Pn is pancyclic
  • By induction
induction2
Induction
  • (1) 3~L
  • (2)L+2
  • (3)L+3~L+4
  • (4)L+5~|V(Pn)|
  • (5)L+1
ad