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...
| Main Authors: | , , |
|---|---|
| Format: | Book Section |
| Language: | English |
| Published: |
Penerbit UTM
2008
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/19338/1/NorHanizaSarmin2008_Double-SimulatedAnnealingModelforMapping.pdf |
| _version_ | 1796855762988826624 |
|---|---|
| author | Loh, Ser Lee Salleh, Shaharudin Sarmin, Nor Haniza |
| author_facet | Loh, Ser Lee Salleh, Shaharudin Sarmin, Nor Haniza |
| author_sort | Loh, Ser Lee |
| collection | ePrints |
| 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). |
| first_indexed | 2024-03-05T18:33:21Z |
| format | Book Section |
| id | utm.eprints-19338 |
| institution | Universiti Teknologi Malaysia - ePrints |
| language | English |
| last_indexed | 2024-03-05T18:33:21Z |
| publishDate | 2008 |
| publisher | Penerbit UTM |
| record_format | dspace |
| spelling | utm.eprints-193382017-07-11T02:25:34Z http://eprints.utm.my/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/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 |
| spellingShingle | QA Mathematics Loh, Ser Lee Salleh, Shaharudin Sarmin, Nor Haniza Double-simulated annealing model for mapping of graphs to single-row networks |
| title | 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_short | 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 |
| topic | QA Mathematics |
| url | http://eprints.utm.my/19338/1/NorHanizaSarmin2008_Double-SimulatedAnnealingModelforMapping.pdf |
| work_keys_str_mv | AT lohserlee doublesimulatedannealingmodelformappingofgraphstosinglerownetworks AT sallehshaharudin doublesimulatedannealingmodelformappingofgraphstosinglerownetworks AT sarminnorhaniza doublesimulatedannealingmodelformappingofgraphstosinglerownetworks |