A Parallel Computational Algorithm for Solving the Maximum k-Vertex Weighted Clique Problem

Zhaocai Wang; Zuwen Ji; Lei Li; Dongmei Huang

首页> 外文期刊>Journal of computational and theoretical nanoscience >A Parallel Computational Algorithm for Solving the Maximum k-Vertex Weighted Clique Problem

【24h】

A Parallel Computational Algorithm for Solving the Maximum k-Vertex Weighted Clique Problem

机译：一种解决最大K-Vertex加权集团问题的并行计算算法

获取原文

获取原文并翻译 | 示例

获取外文期刊封面目录资料

开具论文收录证明 >>

文献代查 >>

文献数据库（团队版） >>

页面导航

摘要
著录项
引文网络
相似文献
相关主题

摘要

The k-vertex weighted clique problem aims to find a vertex clique set with k vertices and maximum weight sum in a given undirected graph. Based on biological molecular computation, the paper describes a new DNA procedure to solve K-vertex weighted clique problem in O(n~2) time complexity, which greatly simplifies the complexity of the computation.

机译：K-Vertex加权Clique问题旨在找到具有K顶点的顶点Clique和给定的无向图中的最大重量和。基于生物分子计算，本文描述了一种新的DNA程序，以解决O（n〜2）时间复杂度的K-Vertex加权集团问题，这大大简化了计算的复杂性。

著录项

来源
《Journal of computational and theoretical nanoscience》 |2015年第12期|共4页
作者
Zhaocai Wang; Zuwen Ji; Lei Li; Dongmei Huang;
展开▼
作者单位

College of Information Shanghai Ocean University Shanghai 201306 P. R. China;

Key Laboratory of Digital Earth Center for Earth Observation and Digital Earth Chinese Academy of Sciences Beijing 100094 P. R. China;

Department of Civil Engineering Xi'an University of Architecture and Technology Xi'an 710055 P. R. China;

College of Information Shanghai Ocean University Shanghai 201306 P. R. China;

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类薄膜技术;
关键词
DNA Computation The k-Vertex Weighted Clique Problem; Adleman-Lipton Model; NP-Complete Problem;

机译：DNA计算K-Vertex加权Clique问题;Adleman-Lipton模型;NP-完整的问题;

相似文献

外文文献
中文文献
专利

1. A Parallel Computational Algorithm for Solving the Maximum k-Vertex Weighted Clique Problem [J] . Zhaocai Wang, Zuwen Ji, Lei Li, Journal of computational and theoretical nanoscience . 2015,第12期

机译：一种解决最大K-Vertex加权集团问题的并行计算算法
2. Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model [J] . ZhaocaiWang, JiangfengQin, ZuwenJi, Mathematical Problems in Engineering: Theory, Methods and Applications . 2015,第3期

机译：基于并行生物计算模型的最大加权派系问题求解
3. An Exact Algorithm for Solving the Maximum Weighted Clique Problem with Using Comparability Supergraphs [J] . Kazuaki YAMAGUCHI, Yoshie SAKAKIBARA, Sumio MASUDA 電子情報通信学会技術研究報告. コンピュテ-ション. Theoretical Foundations of Computing . 2004,第16期

机译：用可比性超图解决最大加权群问题的精确算法
4. Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs Parallel Approximation Algorithms for Maximum Weighted Matching in General Graphs [C] . Ryuhei Uehara, Zhi-Zhong Chen IFIP International Conference on Theoretical Computer Science . 2000

机译：常规图中最大加权匹配的并行近似算法，并行近似算法，用于常规图中的最大加权匹配
5. A Comparison of Quantum Algorithms for the Maximum Clique Problem [D] . Haverly, Andrew R. 2021

机译：量子算法对最大集团问题的比较
6. Fast Parallel Molecular Algorithms for DNA-Based Computation: Solving the Elliptic Curve Discrete Logarithm Problem over GF(2n) [O] . Kenli Li, Shuting Zou, Jin Xv 2008

机译：基于DNA的快速并行分子算法：求解GF（2n）上的椭圆曲线离散对数问题
7. Solving the Maximum Weighted Clique Problem Based on Parallel Biological Computing Model [O] . Zhaocai Wang, Jiangfeng Qin, Zuwen Ji, 2015

机译：基于并行生物计算模型解决最大加权集团问题
8. Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds fromFractional Coloring [R] . Balas, E., Xue, J. 1993

机译：分数着色的上界的加权和未加权最大Clique算法

A Parallel Computational Algorithm for Solving the Maximum k-Vertex Weighted Clique Problem

摘要

著录项

引文网络

相似文献

相关主题

期刊订阅