Approximation algorithms for the k-clique covering problem

被引：0

作者：

Department of Mechanical Engineering, University of Texas at Austin, Austin, TX 78712-1063 ^{[1
]}

机构：

来源：

SIAM J Discrete Math | / 3卷 / 492-509期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[41] k-clique社区知识创新演化方法研究
白如江
冷伏海
图书情报工作 , 2013, (17) : 86 - 94
[42] Finding Small and Large k-Clique Instances on a Quantum Computer
Metwalli S.A.
Gall F.L.E.
Meter R.V.
Metwalli, Sara Ayman (sara@sfc.wide.ad.jp), 1600, Institute of Electrical and Electronics Engineers Inc. (01):
[43] CLIQUE COVERING OF GRAPHS .5. ALGORITHMS
PULLMAN, NJ
SIAM JOURNAL ON COMPUTING, 1984, 13 (01) : 57 - 75
[44] Efficient similarity search in protein structure databases by k-clique hashing
Weskamp, N
Kuhn, D
Hüllermeier, E
Klebe, G
BIOINFORMATICS, 2004, 20 (10) : 1522 - 1526
[45] Parallel k-Clique Community Detection on Large-Scale Networks
Gregori, Enrico
Lenzini, Luciano
Mainardi, Simone
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2013, 24 (08) : 1651 - 1660
[46] Efficient Distributed k-Clique Mining for Large Networks Using MapReduce
Shahrivari, Saeed
Jalili, Saeed
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2021, 33 (03) : 964 - 974
[47] The critical point of k-clique percolation in the Erdos-Renyi graph
Palla, Gergely
Derenyi, Irnre
Vicsek, Tamas
JOURNAL OF STATISTICAL PHYSICS, 2007, 128 (1-2) : 219 - 227
[48] Identifying and evaluating the internet opinion leader community based on k-clique clustering
Zhang, Weizhe
He, Hui
Cao, Boran
NEURAL COMPUTING & APPLICATIONS, 2014, 25 (3-4): : 595 - 602
[49] Approximation algorithms for the k-median problem
Solis-Oba, R
EFFICIENT APPROXIMATION AND ONLINE ALGORITHMS: RECENT PROGRESS ON CLASSICAL COMBINATORIAL OPTIMIZATION PROBLEMS AND NEW APPLICATIONS, 2006, 3484 : 292 - 320
[50] A dynamic edge covering and scheduling problem: complexity results and approximation algorithms
Qiu, Jiaming
Sharkey, Thomas C.
OPTIMIZATION LETTERS, 2014, 8 (04) : 1201 - 1212

← 1 2 3 4 5 →