A direct k-way hypergraph partitioning algorithm for optimizing the Steiner tree metric

DOI10.1137/1.9781611977929.2MaRDI QIDQ6545381FDOQ6545381

Authors: Tobias Heuer 

Publication date: 29 May 2024

Recommendations

• Engineering a direct \(k\)-way hypergraph partitioning algorithm
• A fast hypergraph min-cut algorithm for circuit partitioning
• \(k\)-way hypergraph partitioning via \(n\)-level recursive bisection
• High-Quality Hypergraph Partitioning
• Publication:3210200

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: A direct \(k\)-way hypergraph partitioning algorithm for optimizing the Steiner tree metric

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