Linear-time heuristic partitioning technique for mapping of connected graphs into single-row networks
In this paper, a model called graph partitioning and transformation model (GPTM) which transforms a connected graph into a single-row network is introduced. The transformation is necessary in applications such as in the assignment of telephone channels to caller-receiver pairs roaming in cells in a...
Main Authors: | Ser, Lee Loh, Shaharuddin Salleh, Nor Haniza Sarmin |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Kebangsaan Malaysia
2014
|
Online Access: | http://journalarticle.ukm.my/7525/ http://journalarticle.ukm.my/7525/ http://journalarticle.ukm.my/7525/1/19_Ser_Lee_Loh.pdf |
Similar Items
-
Minimize Network Congestions in Single-Row Networks
by: Noraziah, Ahmad, et al.
Published: (2011) -
The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
by: Lee Jian, Hao
Published: (2013) -
Reducing network congestion by separating nets of single-row networks into layers
by: Noraziah, Ahmad, et al.
Published: (2011) -
The graph heuristic with great deluge algorithm to solve the ITC2007 examination timetabling problem
by: Chuan, Wei Kiat
Published: (2014) -
Combination of Graph Heuristic with Hill Climbing Search for Solving Capacitated Examination Timetabling Problem
by: Ashis Kumar, Mandal, et al.
Published: (2015)