Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures 2023
DOI: 10.1145/3558481.3591087
|View full text |Cite
|
Sign up to set email alerts
|

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1
1

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…The graph partition is proved as NP-hard problem by many previous researches [23], [24]. Fortunately, METIS [25], [26] is the state-of-the-art tool known for its ability to efficiently partition large-scale graphs while aiming for balanced partitions, minimizing edge cuts, and ensuring scalability.…”
Section: B Graph Partitionmentioning
confidence: 99%
“…The graph partition is proved as NP-hard problem by many previous researches [23], [24]. Fortunately, METIS [25], [26] is the state-of-the-art tool known for its ability to efficiently partition large-scale graphs while aiming for balanced partitions, minimizing edge cuts, and ensuring scalability.…”
Section: B Graph Partitionmentioning
confidence: 99%