Sarmin, Nor Haniza and Loh, Ser Lee and Salleh, Shaharuddin (2010) Spanning tree transformation of connected graph into single-row network. In: 2010 Computational and Mathematical Engineering ICCME'10, 24 - 25 Feb 2010.
Full text not available from this repository.
Official URL: http://www.waset.org/journals/waset/v62/v62-90.pdf...
A spanning tree of a connected graph is a tree which consists the set of vertices and some or perhaps all of the edges from the connected graph. In this paper, a model for spanning tree transformation of connected graphs into single-row networks, namely Spanning Tree of Connected Graph Modeling (STCGM) will be introduced. Path-Growing Tree-Forming algorithm applied with Vertex-Prioritized is contained in the model to produce the spanning tree from the connected graph. Paths are produced by Path-Growing and they are combined into a spanning tree by Tree-Forming. The spanning tree that is produced from the connected graph is then transformed into single-row network using Tree Sequence Modeling (TSM). Finally, the single-row routing problem is solved using a method called Enhanced Simulated Annealing for Single-Row Routing (ESSR).
|Item Type:||Conference or Workshop Item (Paper)|
|Uncontrolled Keywords:||graph theory, simulated annealing, single-row routing and spanning tree|
|Deposited By:||Liza Porijo|
|Deposited On:||14 Aug 2012 00:16|
|Last Modified:||07 Feb 2017 07:43|
Repository Staff Only: item control page