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...
保存先:
主要な著者: | , , |
---|---|
フォーマット: | Book Section |
言語: | English |
出版事項: |
Penerbit UTM
2008
|
主題: | |
オンライン・アクセス: | 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 |
タグ: |
タグ追加
タグなし, このレコードへの初めてのタグを付けませんか!
|