Indexed by:
Abstract:
In the problem of maximum noncrossing subset of nets, the current algorithms of using either dynamic programming or the longest common subsequence have the complexity of O(n2). In order to reduce the complexity of the existing algorithms, a more efficient algorithm of using longest increasing subsequence 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. © 2012 Springer-Verlag GmbH Berlin Heidelberg.
Keyword:
Reprint 's Address:
Email:
Version:
Source :
ISSN: 1867-5662
Year: 2012
Volume: 135
Page: 759-767
Language: English
Affiliated Colleges:
操作日志
闫春丽 2024-11-08 09:16:28 数据初审
管理员 2024-01-21 15:34:10 更新被引
管理员 2020-11-19 17:58:42 创建