Generalizing Lloyd’s Algorithm for Graph Clustering-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Generalizing Lloyd’s Algorithm for Graph Clustering

Published:2024-09-03 Issue:5 Volume:46 Page:A2819-A2847
ISSN:1064-8275
Container-title:SIAM Journal on Scientific Computing
language:en
Short-container-title:SIAM J. Sci. Comput.

Author:

Zaman Tareq¹,Nytko Nicolas²,Taghibakhshi Ali³,MacLachlan Scott¹^ORCID,Olson Luke²^ORCID,West Matthew³

Affiliation:

1. Interdisciplinary Program in Scientific Computing, Memorial University of Newfoundland, St. John’s, NL A1C 5S7, Canada.

2. Department of Computer Science, University of Illinois Urbana-Champaign, Urbana, IL 61801 USA.

3. Department of Mechanical Science and Engineering, University of Illinois Urbana-Champaign, Urbana, IL 61801 USA.

Funder

Natural Sciences and Engineering Research Council of Canada

National Nuclear Security Administration

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Reference22 articles.

1. Exposing Fine-Grained Parallelism in Algebraic Multigrid Methods

2. PyAMG: Algebraic Multigrid Solvers in Python

3. Theoretical Analysis of the k-Means Algorithm – A Survey

4. Algebraic Multilevel Preconditioners for the Graph Laplacian Based on Matching in Graphs

5. A Multigrid Tutorial, Second Edition

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP