Improved Heuristic for Planarization of Clustered Graph
碩士 === 國立清華大學 === 資訊系統與應用研究所 === 103 === Planarization of clustered graph is a series of operations to transform the underlying graph by creation of degree four crossing dummies such that the result becomes a c-planar clustered graph. The heuristic for planarization consists of two stages: finding a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/25247494105262389430 |