Spanning Tree Transformation of Connected Graph into Single-Row Network

Loh, Ser Lee and Salleh, Shaharuddin and Sarmin, Nor Haniza (2010) Spanning Tree Transformation of Connected Graph into Single-Row Network. In: International Conference on Computational and Mathematical Engineering, 24 - 25 February 2010, Bayview Hotel Georgetown, Penang, Malaysia.

[img]
Preview
PDF
ICCME_2010.pdf

Download (409kB)

Abstract

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)
Subjects: Q Science > Q Science (General)
Divisions: Faculty of Electrical Engineering > Department of Industrial Power
Depositing User: Dr Ser Lee Loh
Date Deposited: 02 Jul 2014 06:51
Last Modified: 28 May 2015 04:26
URI: http://eprints.utem.edu.my/id/eprint/12630
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item