Single-row mapping and transformation of connected graphs
In a dimensional problem, the transformation of a graph into its linear network can be viewed as a transition involving demand and supply. A connected graph represents the demand flows between the components in the graph while the network supporting it is the resource or capacity links for supportin...
Saved in:
Main Authors: | Salleh, Shaharuddin Hussain, Olariu, Stephan, Zomaya, Albert Y H, Yieng, K.L, B. Aziz, Nur Arina |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer Netherlands
2007
|
Online Access: | http://eprints.utm.my/id/eprint/7542/1/Salleh_Shaharuddin_2007_Single-Row_Mapping_Transformation_Connected_Graphs.pdf http://eprints.utm.my/id/eprint/7542/ http://dx.doi.org/10.1007/s11227-006-0005-4 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Single-row transformation of complete graphs
by: Salleh, Shahruddin Hussain, et al.
Published: (2005) -
Enhanced simulated annealing technique for the single-row routing problem
by: Salleh, Shaharuddin, et al.
Published: (2002) -
Development of models for transformation of connected graphs into single-row networks
by: Ser, Lee Loh, et al.
Published: (2011) -
Partitioning Technique for Transformation of Connected Graphs into Single-Row Network
by: Loh, Ser Lee, et al.
Published: (2011) -
Spanning Tree Transformation of Connected Graph into Single-Row Network
by: Loh, Ser Lee, et al.
Published: (2010)