Geometry, flows, and graph-partitioning algorithms-Reference-Cited by-同舟云学术

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

Geometry, flows, and graph-partitioning algorithms

Published:2008-10 Issue:10 Volume:51 Page:96-105
ISSN:0001-0782
Container-title:Communications of the ACM
language:en
Short-container-title:Commun. ACM

Author:

Arora Sanjeev¹,Rao Satish²,Vazirani Umesh²

Affiliation:

1. Princeton University, Princeton, NJ

2. UC, Berkeley, CA

Funder

Division of Computing and Communication Foundations

National Science Foundation

Publisher

Association for Computing Machinery (ACM)

Subject

General Computer Science

Link

https://dl.acm.org/doi/pdf/10.1145/1400181.1400204

Reference18 articles.

1. Eigenvalues and expanders

2. 0(\sqrt {\log n)} Approximation to SPARSEST CUT in Õ(n²) Time

3. A combinatorial, primal-dual approach to semidefinite programs

4. Euclidean distortion and the sparsest cut. J. Amer Math;Arora S.;Soc.,2008

Cited by 25 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Bridge-Rhombus Transformation to Solve Partitioning Problem in Telecommunications Network;2024 International Technical Conference on Circuits/Systems, Computers, and Communications (ITC-CSCC);2024-07-02

2. An Escape Time Formulation for Subgraph Detection and Partitioning of Directed Graphs;SIAM Journal on Matrix Analysis and Applications;2024-02-26

3. Fast and Robust Sparsity-Aware Block Diagonal Representation;IEEE Transactions on Signal Processing;2024

4. Multi-objective graph partitioning for the MFD-based perimeter control of an urban network;2022-09-14

5. Graph Computing Systems and Partitioning Techniques: A Survey;IEEE Access;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP