請用此 Handle URI 來引用此文件: http://hdl.handle.net/11455/38335
標題: An Optimal Algorithm for the Maximum Two-Chain Problem
作者: R.D.Lou
M.Sarrafzadeh
D.T.Lee
摘要: Given a point set p, a chain is a subset C C p of points in which for any two points one is dominated by the other. A two-chain is a subset of p that can be partitioned into two chains. A two-chain with maximum cardinality among all possible two-chains is called a maximum two-chain. In this paper we present a O(nlog n) time and O(n) space algorithm for finding a maximum two-chain in a point set p, where n = IpI. Maximum two-chain finds appli- cations in, for example, graph-theoretic problems; VLSI layout, and sequence manipulation.
URI: http://hdl.handle.net/11455/38335
顯示於類別:資訊科學與工程學系所

文件中的檔案:
沒有與此文件相關的檔案。


在 DSpace 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。