Minimum Cuts in Directed Graphs via Partial Sparsification-Reference-Cited by-同舟云学术

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

Minimum Cuts in Directed Graphs via Partial Sparsification

Published:2022-02 Issue: Volume: Page:
ISSN:
Container-title:2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS)
language:
Short-container-title:

Author:

Cen Ruoxu¹,Li Jason²,Nanongkai Danupon³,Panigrahi Debmalya¹,Saranurak Thatchaphol⁴,Quanrud Kent⁵

Affiliation:

1. Duke University,Department of Computer Science

2. Simons Institute for Theory of Computing,UC Berkeley

3. University of Copenhagen,Department of Computer Science

4. University of Michigan Ann Arbor,Computer Science & Engineering Division

5. Purdue University,Department of Computer Science

Publisher

IEEE

Link

http://xplorestaging.ieee.org/ielx7/9719594/9719683/09719719.pdf?arnumber=9719719

Reference30 articles.

1. Randomized rounding without solving the linear program;young;Proc 6th Annual ACM-SIAM Symposium on Discrete Algorithms - SODA'95,1995

2. Efficient algorithms for finding minimum spanning trees in undirected and directed graphs

3. Finding the Vertex Connectivity of Graphs

4. Fully dynamic electrical flows: Sparse maxflow faster than goldberg-rao;gao;CoRR,2021

5. Minimum cut in o(m log2 n) time;gawrychowski;ICALP,2020

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

1. Max-flow min-cut theorem in quantum computing;Physica A: Statistical Mechanics and its Applications;2024-09

2. Fast Algorithms via Dynamic-Oracle Matroids;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP