Home>Results

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

[会议论文]

Finding maximum noncrossing subset of nets using longest increasing subsequence

Share
Edit Delete 报错

author:

Deng, Xinguo (Deng, Xinguo.) [1] (Scholars:邓新国) | Zhong, Rui (Zhong, Rui.) [2]

Indexed by:

EI Scopus

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:

Computer software C++ (programming language) Data mining Dynamic programming

Community:

  • [ 1 ] [Deng, Xinguo]Center for Discrete Mathematics, Software College, Fuzhou University, Fuzhou, China
  • [ 2 ] [Zhong, Rui]National Engineering Research Center for Multimedia Software, Wuhan University, Wuhan, China

Reprint 's Address:

Show more details

Version:

Source :

ISSN: 1867-5662

Year: 2012

Volume: 135

Page: 759-767

Language: English

Cited Count:

WoS CC Cited Count: 数据采集中

30 Days PV: 5

操作日志

闫春丽  2024-11-08 09:16:28  数据初审

管理员  2024-01-21 15:34:10  更新被引

管理员  2020-11-19 17:58:42  创建

Online/Total:182/9281451
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