Geometric representations of distinct Hamiltonian circuits in complete graph decomposition
Visualization of geometric representations of distinct Hamiltonian circuits in complete graphs is needed to avoid structures resemblance in real application. However, there are only a few studies that consider graph visualization, whereas most researchers focus on computation time. Thus, this study...
Saved in:
主要作者: | Maizon, Mohd Darus |
---|---|
格式: | Thesis |
语言: | eng eng |
出版: |
2015
|
主题: | |
在线阅读: | https://etd.uum.edu.my/5322/1/s808768.pdf https://etd.uum.edu.my/5322/2/s808768_abstract.pdf |
标签: |
添加标签
没有标签, 成为第一个标记此记录!
|
相似书籍
-
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
由: Dinon, Nur Atiqah
出版: (2013) -
Enhanced prim's algorithm for finding the hamiltonian cycle in a graph
由: Dinon, Nur Atiqah
出版: (2013) -
Hamiltonian circuited simulations of partial differential equations of the elliptic type /
由: Rio Hirowati Shariffudin
出版: (2001) -
On graphs which have strong Hamiltonian properties /
由: Tan, Li Yin
出版: (2010) -
Cubic Hamiltonian graphs and generalized knight's tours /
由: Ong, Siew Hui
出版: (2001)