搜索筛选:
搜索耗时2.0287秒,为你在为你在102,285,761篇论文里面共找到 3 篇相符的论文内容
发布年度:
[期刊论文] 作者：MA Jun,MA Shaohan,
来源：计算机科学技术学报（英文版） 年份：1999
A fast and efficient parallel algorithm for finding a maximal edge matching in an undirected graph G(V,E) is proposed. It runs inO (log n) time with O (m/log n+...
[期刊论文] 作者：MA Jun,YANG Bo,MA Shaohan,
来源：计算机科学技术学报 年份：2004
An O(n2) time approximation algorithm for the minimum rectilinear Steiner tree is proposed. The approximation ratio of the algorithm is strictly less than 1.5....
[期刊论文] 作者：Zhu Daming,LUAN Junfeng,MA Shaohan,
来源：计算机科学技术学报(英文版) 年份：2001
The paper briefly reviews NP-hard optimization problems and their inapproximability. The hardness of solving CLIQUE problem is specifically discussed. A dynamic...
相关搜索：
