Cover Image

Double-simulated annealing model for mapping of graphs to single-row networks

Connected g raph is a graph where every pair of distinct vertices in the graph is connecte d either dire ctly or ind irectly. In our real life, m any science and engineerin g applications can be reduced into the connected graph representations, such...

Full description

Saved in:
Bibliographic Details
Main Authors: Loh, Ser Lee, Salleh, Shaharudin, Sarmin, Nor Haniza
Format: Book Section
Language:English
Published: Penerbit UTM 2008
Subjects:
QA Mathematics
Online Access:http://eprints.utm.my/id/eprint/19338/1/NorHanizaSarmin2008_Double-SimulatedAnnealingModelforMapping.pdf
http://eprints.utm.my/id/eprint/19338/
https://core.ac.uk/download/pdf/11793683.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
id my.utm.19338
record_format eprints
spelling my.utm.193382017-07-11T02:25:34Z http://eprints.utm.my/id/eprint/19338/ Double-simulated annealing model for mapping of graphs to single-row networks Loh, Ser Lee Salleh, Shaharudin Sarmin, Nor Haniza QA Mathematics Connected g raph is a graph where every pair of distinct vertices in the graph is connecte d either dire ctly or ind irectly. In our real life, m any science and engineerin g applications can be reduced into the connected graph representations, such as telecommunication and wireless s ensor problem s. A connected graph can be transform ed into single row-routing network as shown by Salleh et. al. in 2007. However, the earlier work does not produce optim al results in as the ordering in G is sequentially done. In this paper we will present a co mplete optim izing modeling for single row transform ation of conne cted graphs. Thus, the effort to optim ize the ordering of vertices in connected graph for transf orm ation into a planar graph in the form of single-row network is carried out through the new interval form ation and Double Simulated Annealing (DSA). Penerbit UTM 2008 Book Section PeerReviewed application/pdf en http://eprints.utm.my/id/eprint/19338/1/NorHanizaSarmin2008_Double-SimulatedAnnealingModelforMapping.pdf Loh, Ser Lee and Salleh, Shaharudin and Sarmin, Nor Haniza (2008) Double-simulated annealing model for mapping of graphs to single-row networks. In: Advances In Fundamentals and Social Sciences. Penerbit UTM , Johor, pp. 31-39. ISBN 978-983-52-0609-2 https://core.ac.uk/download/pdf/11793683.pdf
institution Universiti Teknologi Malaysia
building UTM Library
collection Institutional Repository
continent Asia
country Malaysia
content_provider Universiti Teknologi Malaysia
content_source UTM Institutional Repository
url_provider http://eprints.utm.my/
language English
topic QA Mathematics
spellingShingle QA Mathematics
Loh, Ser Lee
Salleh, Shaharudin
Sarmin, Nor Haniza
Double-simulated annealing model for mapping of graphs to single-row networks
description Connected g raph is a graph where every pair of distinct vertices in the graph is connecte d either dire ctly or ind irectly. In our real life, m any science and engineerin g applications can be reduced into the connected graph representations, such as telecommunication and wireless s ensor problem s. A connected graph can be transform ed into single row-routing network as shown by Salleh et. al. in 2007. However, the earlier work does not produce optim al results in as the ordering in G is sequentially done. In this paper we will present a co mplete optim izing modeling for single row transform ation of conne cted graphs. Thus, the effort to optim ize the ordering of vertices in connected graph for transf orm ation into a planar graph in the form of single-row network is carried out through the new interval form ation and Double Simulated Annealing (DSA).
format Book Section
author Loh, Ser Lee
Salleh, Shaharudin
Sarmin, Nor Haniza
author_facet Loh, Ser Lee
Salleh, Shaharudin
Sarmin, Nor Haniza
author_sort Loh, Ser Lee
title Double-simulated annealing model for mapping of graphs to single-row networks
title_short Double-simulated annealing model for mapping of graphs to single-row networks
title_full Double-simulated annealing model for mapping of graphs to single-row networks
title_fullStr Double-simulated annealing model for mapping of graphs to single-row networks
title_full_unstemmed Double-simulated annealing model for mapping of graphs to single-row networks
title_sort double-simulated annealing model for mapping of graphs to single-row networks
publisher Penerbit UTM
publishDate 2008
url http://eprints.utm.my/id/eprint/19338/1/NorHanizaSarmin2008_Double-SimulatedAnnealingModelforMapping.pdf
http://eprints.utm.my/id/eprint/19338/
https://core.ac.uk/download/pdf/11793683.pdf
_version_ 1643647118927200256
score 13.211869

Similar Items