S.L. Loh and S. Salleh and N.H. Sarmin
Spanning Tree Transformation of Connected Graphs into SingleRow Networks
271 - 275
2010
4
2
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/4353
https://publications.waset.org/vol/38
World Academy of Science, Engineering and Technology
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 singlerow networks, namely
Spanning Tree of Connected Graph Modeling (STCGM) will be
introduced. PathGrowing TreeForming algorithm applied with
VertexPrioritized is contained in the model to produce the spanning
tree from the connected graph. Paths are produced by PathGrowing
and they are combined into a spanning tree by TreeForming. The
spanning tree that is produced from the connected graph is then
transformed into singlerow network using Tree Sequence Modeling
(TSM). Finally, the singlerow routing problem is solved using a
method called Enhanced Simulated Annealing for SingleRow
Routing (ESSR).
Open Science Index 38, 2010