Linear-time heuristic partitioning technique for mapping
of connected graphs into single-row networks

QR Code

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...

Full description

Bibliographic Details
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/1/19_Ser_Lee_Loh.pdf

Similar Items

Single-row mapping and transformation of connected graphs
by: Salleh, Shaharuddin Hussain, et al.
Published: (2007)

Single-row transformation of complete graphs
by: Salleh, Shahruddin Hussain, et al.
Published: (2005)

Interstreet crossing issues in single-row routing
by: Salleh, Shaharuddin
Published: (2006)

Interstreet crossing issues in single-row routing
by: Salleh, Shaharuddin
Published: (2006)

Enhanced simulated annealing technique for the single-row routing problem
by: Salleh, Shaharuddin, et al.
Published: (2002)

Restricted spanning trees and graph partitioning.
by: Lam, Bee K.
Published: (1999)

On some packing and partition problems in geometric graphs
by: Trao, Hazim Michman
Published: (2018)

Minimize Network Congestions in Single-Row Networks
by: Noraziah, Ahmad, et al.
Published: (2011)

Hybrid Graph Heuristics within a Hyper-heuristic Approach to Exam Timetabling Problems
by: Burke, Edmund, et al.
Published: (2005)

Connected Domination Critical Graphs
by: Kaemawichanurat, Pawaton
Published: (2015)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

A graph-based hyper heuristic for timetabling problems
by: Burke, Edmund, et al.
Published: (2007)

Identification of Soybean Genotypes in Wide Rows for Use in NClI'row-row Culture
by: Saleh, Ghizan, et al.
Published: (1988)

Graph theoretic based heuristics for the facility layout design problem
by: Kusumah, Yaya S,
Published: (2001)

A grouping hyper-heuristic framework: application on graph colouring
by: Elhag, Anas, et al.
Published: (2015)

Web user navigation pattern mining approach based on graph partitioning algorithm.
by: Jalali, Mehrdad, et al.
Published: (2008)

Chromatically unique bipartite graphs with certain 3-independent partition numbers III
by: Hasni @ Abdullah, Roslan, et al.
Published: (2007)

A new clustering approach based on graph partitioning for navigation patterns mining
by: Jalali, Mehrdad, et al.
Published: (2008)

Hamiltonicity of connected domination critical graphs
by: Kaemawichanurat, P., et al.
Published: (2018)

Chromaticity of Certain 2-Connected Graphs
by: Lau, Gee Choon
Published: (2003)

Reducing network congestion by separating nets of single-row networks into layers
by: Noraziah, Ahmad, et al.
Published: (2011)

Tolerable Constructive Graph-Based Hyper-Heuristic Algorithm For Examination Timetabling
by: Mohammad Pour, Shahrzad
Published: (2009)

A new method for the row-by-row decoupling problem with pole assignment
by: Garone, Emanuele, et al.
Published: (2016)

A tabu search for multi-objective single row facility layout problem
by: Lenin, N., et al.
Published: (2014)

Performance analyses of graph heuristics and selected trajectory metaheuristics on examination timetable problem
by: Mandal, Ashis Kumar, et al.
Published: (2020)

Real-time inter-row tree detection and tracking techniques for unmanned vehicle-based on simultaneous localization and mapping approach / Norashikin M. Thamrin
by: M. Thamrin, Norashikin
Published: (2017)

Real-time inter-row tree detection and tracking techniques for unmanned vehicle-based on simultaneous localization and mapping approach / Norashikin M. Thamrin
by: M. Thamrin, Norashikin
Published: (2017)

Bounds on the order of connected domination vertex critical graphs
by: Kaemawichanurat, P., et al.
Published: (2018)

Critical graphs with respect to total domination and connected domination
by: Kaemawichanurat, P., et al.
Published: (2016)

On the Higher Order Edge-Connectivity of Complete Multipartite Graphs
by: Peng, Y. H., et al.
Published: (1989)

Eccentric connectivity index of unicyclic graphs with application to cycloalkanes
by: Haoer, Raad Sehen, et al.
Published: (2015)

Comparison between atom-bond connectivity indices of graphs
by: Das, Kinkar Ch., et al.
Published: (2016)

Effect of inclined rowing machine on FES-assisted indoor rowing exercise performance
by: Hussain, Zakaria, et al.
Published: (2009)

Multi-objective optimization in single-row layout design using a genetic algorithm
by: Lenin, N., et al.
Published: (2012)

Hybridizations within a graph based hyper-heuristic framework for university timetabling problems
by: Qu, Rong, et al.
Published: (2008)

The implementation of partial graph heuristic with improvement method to solve the UMP examination timetabling problem
by: Lee Jian, Hao
Published: (2013)

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)

A characterization of 3-i-critical graphs of connectivity two
by: Ananchuen, N., et al.
Published: (2017)

On the atom bond connectivity index of certain trees and unicyclic graphs
by: Mohammed, Mohanad Ali, et al.
Published: (2015)