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...
Saved in:
Main Authors: | Loh, Ser Lee, Salleh, Shaharudin, Sarmin, Nor Haniza |
---|---|
Format: | Book Section |
Language: | English |
Published: |
Penerbit UTM
2008
|
Subjects: | |
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!
|
Similar Items
-
Double Simulated Annealing Model for Mapping of Graphs to
Single-Row Networks
by: Loh, Ser Lee, et al.
Published: (2008) -
Linear-time heuristic partitioning technique for mapping
of connected graphs into single-row networks
by: Ser, Lee Loh, et al.
Published: (2014) -
Development of models for transformation of connected graphs into single-row networks
by: Ser, Lee Loh, et al.
Published: (2011) -
Models development for single-row networks from connected graphs
by: Loh, Ser Lee, et al.
Published: (2012) -
Models Development for Single-Row Networks from Connected Graphs
by: Loh, Ser Lee, et al.
Published: (2012)