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 (Author), Shaharuddin Salleh (Author), Nor Haniza Sarmin (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Universiti Kebangsaan Malaysia,
2014-08.
|
Online Access: | Get fulltext |
Similar Items
-
Single-row mapping and transformation of connected graphs
by: Salleh, Shaharuddin Hussain, et al.
Published: (2007) -
Placement and routing in VLSI design problem using single row routing technique
by: Johar, Farhana, et al.
Published: (2007) -
Single-row transformation of complete graphs
by: Salleh, Shahruddin Hussain, et al.
Published: (2005) -
Enhanced simulated annealing technique for the single-row routing problem
by: Salleh, Shaharuddin, et al.
Published: (2002) -
NEW HEURISTICS FOR THE PROBLEM OF CLIQUE PARTITIONING OF GRAPHS
by: SAUL GUALBERTO DE AMORIM JUNIOR
Published: (1989)