Improving Particle Swarm Optimization to Solve the 2-Page Book Drawing Problem of Graphic
碩士 === 中原大學 === 資訊管理研究所 === 96 === The minimization of edge crossings in a book drawing of a graph is one of the important goals for a linear VLSI design, and the 2-page crossing number of a graph provides an upper bound for the standard planar crossing number. Particle Swarm Optimization (PSO) is a...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68018195932823579369 |