An effective algorithm for multiway hypergraph partitioning

DOI10.1109/TCSI.2002.801224zbMATH Open1368.05148OpenAlexW2149297000MaRDI QIDQ5349544FDOQ5349544

Authors: Zhizi Zhao, Lixin Tao, Yongchang Zhao 

Publication date: 25 August 2017

Published in: IEEE Transactions on Circuits and Systems I: Fundamental Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcsi.2002.801224

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Hypergraphs (05C65) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Cited In (2)

• Multi-level direct \(K\)-way hypergraph partitioning with multiple constraints and fixed vertices
• A multi-level hypergraph partitioning algorithm using rough set clustering

This page was built for publication: An effective algorithm for multiway hypergraph partitioning

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