Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition-Reference-Cited by-同舟云学术

Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition

Published:2022 Issue: Volume: Page:70-83
ISSN:0302-9743
Container-title:Integer Programming and Combinatorial Optimization
language:
Short-container-title:

Author:

Beideman Calvin,Chandrasekaran Karthekeyan,Mukhopadhyay Sagnik,Nanongkai Danupon

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-06901-7_6

Reference33 articles.

1. Beideman, C., Chandrasekaran, K., Mukhopadhyay, S., Nanongkai, D.: Faster connectivity in low-rank hypergraphs via expander decomposition. CoRR abs/2011.08097 (2021)

2. Bernstein, A., et al.: Fully-dynamic graph sparsifiers against an adaptive adversary. CoRR abs/2004.08432 (2020)

3. Bernstein, A., Gutenberg, M.P., Saranurak, T.: Deterministic decremental reachability, SCC, and shortest paths via directed expanders and congestion balancing. In: FOCS. IEEE Computer Society (2020)

4. Chandrasekaran, K., Xu, C., Yu, X.: Hypergraph $$k$$-cut in randomized polynomial time. Mathematical Programming (Preliminary version in SODA 2018), November 2019

5. Chekuri, C., Quanrud, K.: Isolating cuts, (Bi-)submodularity, and faster algorithms for connectivity. In: ICALP, pp. 50:1–50:20 (2021)

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

1. Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions;ACM Transactions on Algorithms;2023-04-15

2. Faster Connectivity in Low-Rank Hypergraphs via Expander Decomposition;Integer Programming and Combinatorial Optimization;2022