Partitioning Technique for Transformation of Connected Graphs into Single-Row Network

Loh, Ser Lee and Salleh, Shaharuddin and Sarmin, Nor Haniza (2011) Partitioning Technique for Transformation of Connected Graphs into Single-Row Network. Jurnal Teknologi . pp. 241-253. ISSN 2180-3722

Journal_Teknologi_(55).pdf - Published Version

Download (164kB)


In this paper, we present our work called Connected Graph Sequence (CGS) which transforms a partially dense graph into the single-row network. Partially dense graph is a graph where a number of connected components, namely subgraphs, are connected by some links and each subgraph has a higher density value compare to the graph. The transformation is necessary in applications such as in the assignment of telephone channels to caller-receiver pairs roaming in cells in a cellular network on real-time basis. In this channel assignment application, each caller and receiver in a call is treated as a node, while their pair connection is treated as the edge. A specific case of the graph in the form of a partially dense graph is then transformed into its corresponding single-row network for assigning the channels to the caller-receiver pairs.

Item Type: Article
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:48
Last Modified: 28 May 2015 04:26
Statistic Details: View Download Statistic

Actions (login required)

View Item View Item