Massive Quasi-Clique Detection
Author:
Publisher
Springer Berlin Heidelberg
Link
http://link.springer.com/content/pdf/10.1007/3-540-45995-2_51
Reference12 articles.
1. J. Abello, P. Pardalos and M. Resende, editors. Handbook of Massive Data Sets, Kluwer Academic Publishers, 2002.
2. Lect Notes Comput Sci;J. Abello,1998
3. J. Abello and J. Vitter, editors. External Memory Algorithms, volume 50 of DIMACS Series on Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, 1999.
4. S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. Proc. 33rd IEEE Symp. on Foundations of Computer Science, pages 14–23, 1992.
5. S. Arora and S. Safra. Probabilistic checking of proofs: A new characterization of NP. J. of the ACM, volume 45, pages 70–122, 1998.
Cited by 218 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Clustering graph data: the roadmap to spectral techniques;Discover Artificial Intelligence;2024-01-22
2. Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution;IEEE Transactions on Knowledge and Data Engineering;2024-01
3. On finding the community with maximum persistence probability;4OR;2023-12-26
4. Asymptotic bounds for clustering problems in random graphs;Networks;2023-12-13
5. Efficient Maximum k-Defective Clique Computation with Improved Time Complexity;Proceedings of the ACM on Management of Data;2023-11-13
1.学者识别学者识别
2.学术分析学术分析
3.人才评估人才评估
"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370
www.globalauthorid.com
TOP
Copyright © 2019-2024 北京同舟云网络信息技术有限公司 京公网安备11010802033243号 京ICP备18003416号-3