• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
成果搜索

author:

Deng, Xinguo (Deng, Xinguo.) [1] (Scholars:邓新国) | Wu, Wangyu (Wu, Wangyu.) [2] | Fang, Lina (Fang, Lina.) [3]

Indexed by:

EI Scopus

Abstract:

In the problem of crossing distribution of circuit wires between two regions, the current algorithms of using either linear list or dynamic programming have the complexity of O(n2). In order to reduce the complexity of the existing algorithms, a more efficient algorithm of using indexed binary search tree is introduced in this paper. The effectiveness of the algorithm with a time consuming complexity of O(nlogn) is illustrated through the theoretical analysis and by demonstrating the experiment results of corresponding C++ program. © 2011 IEEE.

Keyword:

Binary trees Complex networks Computer software C++ (programming language) Dynamic programming Forestry Timing circuits Trees (mathematics) Wire

Community:

  • [ 1 ] [Deng, Xinguo]College of Software, Fuzhou University, Fuzhou, China
  • [ 2 ] [Wu, Wangyu]College of Software, Fuzhou University, Fuzhou, China
  • [ 3 ] [Fang, Lina]Shenzhen Institute of Information Technology, Shenzhen, China

Reprint 's Address:

Show more details

Version:

Related Keywords:

Source :

Year: 2011

Volume: 4

Page: 2799-2802

Language: English

Cited Count:

WoS CC Cited Count:

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count:

Chinese Cited Count:

30 Days PV: 1

Online/Total:145/10019505
Address:FZU Library(No.2 Xuyuan Road, Fuzhou, Fujian, PRC Post Code:350116) Contact Us:0591-22865326
Copyright:FZU Library Technical Support:Beijing Aegean Software Co., Ltd. 闽ICP备05005463号-1