{"title":"Spanning Tree Transformation of Connected Graphs into Single-Row Networks","authors":"S.L. Loh, S. Salleh, N.H. Sarmin","country":null,"institution":"","volume":38,"journal":"International Journal of Mathematical and Computational Sciences","pagesStart":271,"pagesEnd":276,"ISSN":"1307-6892","URL":"https:\/\/publications.waset.org\/pdf\/4353","abstract":"A spanning tree of a connected graph is a tree which\r\nconsists the set of vertices and some or perhaps all of the edges from\r\nthe connected graph. In this paper, a model for spanning tree\r\ntransformation of connected graphs into single-row networks, namely\r\nSpanning Tree of Connected Graph Modeling (STCGM) will be\r\nintroduced. Path-Growing Tree-Forming algorithm applied with\r\nVertex-Prioritized is contained in the model to produce the spanning\r\ntree from the connected graph. Paths are produced by Path-Growing\r\nand they are combined into a spanning tree by Tree-Forming. The\r\nspanning tree that is produced from the connected graph is then\r\ntransformed into single-row network using Tree Sequence Modeling\r\n(TSM). Finally, the single-row routing problem is solved using a\r\nmethod called Enhanced Simulated Annealing for Single-Row\r\nRouting (ESSR).","references":null,"publisher":"World Academy of Science, Engineering and Technology","index":"Open Science Index 38, 2010"}