Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications-Reference-Cited by-同舟云学术

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications

Published:2023-06-17 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures
language:
Short-container-title:

Author:

Papp Pál András¹^ORCID,Anegg Georg¹^ORCID,Yzelman Albert-Jan N.¹^ORCID

Affiliation:

1. Huawei Zurich Research Center, Zurich, Switzerland

Publisher

ACM

Link

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

Reference47 articles.

1. Joël Alwen , Susanna F De Rezende , Jakob Nordström , and Marc Vinyals . 2017 . Cumulative space in black-white pebbling and resolution . In 8th Innovations in Theoretical Computer Science Conference (ITCS). Joël Alwen, Susanna F De Rezende, Jakob Nordström, and Marc Vinyals. 2017. Cumulative space in black-white pebbling and resolution. In 8th Innovations in Theoretical Computer Science Conference (ITCS).

2. Balanced Graph Partitioning

3. Public-key cryptography from different assumptions

4. Expander flows, geometric embeddings and graph partitioning

5. Rob H Bisseling . 2020. Parallel Scientific Computation: A Structured Approach Using BSP . Oxford University Press . Rob H Bisseling. 2020. Parallel Scientific Computation: A Structured Approach Using BSP. Oxford University Press.

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

1. Efficient Multi-Processor Scheduling in Increasingly Realistic Models;Proceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures;2024-06-17

2. Optimizing Task Orchestration for Distributed Real-Time Electromagnetic Transient Simulation;IEEE Access;2024