FREIGHT: fast streaming hypergraph partitioning

DOI10.1007/S00453-024-01291-8MaRDI QIDQ7022270zbMATH OpenFDO

Authors Kamal Eyubov, Christian Schulz

Publication date 25 February 2025

Published in Algorithmica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00453-024-01291-8

zbMATH Keywords

algorithm engineeringgraph partitioninghypergraph partitioningstreaming algorithms

Mathematics Subject Classification ID

Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Online algorithms; streaming algorithms (68W27)

Cites work

• k-way hypergraph partitioning via n-level recursive bisection
• An MPI-based algorithm for mapping complex networks onto hierarchical architectures
• Buffered Streaming Graph Partitioning
• Deep multilevel graph partitioning
• Finding good approximate vertex and edge partitions is NP-hard
• High-quality hierarchical process mapping
• High-Quality Hypergraph Partitioning
• Scalable Shared-Memory Hypergraph Partitioning
• The University of Florida sparse matrix collection

This page was built for publication: FREIGHT: fast streaming hypergraph partitioning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022270)