Partitioning Technique for Transformation of Connected Graphs into Single-Row Network
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...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | en |
| Published: |
Universiti Teknologi Malaysia
2011
|
| Subjects: | |
| Online Access: | http://eprints.utem.edu.my/id/eprint/12628/1/Journal_Teknologi_%2855%29.pdf http://eprints.utem.edu.my/id/eprint/12628/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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. |
|---|