Single-row transformation of complete graphs
A complete graph is a fully-connected graph where every node is adjacent to all other nodes in the graph. Very often, many applications in science and engineering are reducible to this type of graph. Hence, a simplified form of a complete graph contributes in providing the solutions to these problem...
Main Authors: | Salleh, Shahruddin Hussain (Author), Olariu, Stephan (Author), Sanugi, Bahrom (Author), Aziz, Mohd Ismail Abd (Author) |
---|---|
Format: | Article |
Language: | English |
Published: |
Springer,
2005-03.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Enhanced simulated annealing technique for the single-row routing problem
by: Salleh, Shaharuddin, et al.
Published: (2002) -
Placement and routing in VLSI design problem using single row routing technique
by: Johar, Farhana, et al.
Published: (2007) -
Taguchi approach for performance evaluation of routing protocols in mobile ad hoc networks
by: Mohamed, Hazura, et al.
Published: (2010) -
Graph cut segmentation method and its application in medical images
by: Norouzi, Alireza, et al.
Published: (2015) -
Adaptive memory-based single distribution resampling for particle filter
by: Bejuri, W. M. Y. W., et al.
Published: (2017)