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...
Saved in:
| Main Authors: | , , , |
|---|---|
| 格式: | Article |
| 語言: | English |
| 出版: |
Springer
2005
|
| 主題: | |
| 在線閱讀: | http://eprints.utm.my/id/eprint/7532/1/Salleh_Shaharuddin_2005_Single-Row_Transformation_Complete_Graphs.pdf http://eprints.utm.my/id/eprint/7532/ http://dx.doi.org/10.1007/s11227-005-0184-4 |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
| 總結: | 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 problems. In this paper, we present a technique for transforming a complete graph into a single-row routing problem. Single-row routing is a classical technique in the VLSI design that is known to be NP-complete. We solved this problem earlier using a method called ESSR, and, the same technique is applied to the present work to transform a complete graph into its single-row routing representation. A parallel computing model is proposed which contributes in making the problem modular and scalable. We also discuss the application of this work on the channel assignment problem in the wireless cellular telephone networks. |
|---|