Counting the crossing wires in the crossing distribution of circuit wires between two regions,the current algorithms using either linear list or dynamic programming to do so have the time complexity O(n2). In order to reduce the time complexity of the existing algorithms efficiently,a counting algorithm with the time complexity of O( nlogn) using arborescence array is introduced in this paper.Furthermore,all crossing wires of every circuit wire are found with this algorithm. The effectiveness of the algorit...
| 
推荐 
点击下列相关研究机构和相关文献作者，可以直接查到这些机构和作者被《中国知识资源总库》收录的其它文献，使您全面了解该机构和该作者的研究动态和历史。
