A method of improving initial partition of Fiduccia-Mattheyses algorithm

DOI10.1134/S1995080218090196MaRDI QIDQ669520zbMATH OpenOpenAlexWikidataFDO

Authors M. V. Sheblaev, A. S. Sheblaeva

Publication date 15 March 2019

Published in Lobachevskii Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1134/s1995080218090196

zbMATH Keywords

balanced graph partitioningbalanced cutFiduccia-Mattheyses algorithmFM algorithmMIN-cut

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Hypergraphs (05C65)

Recommendations

• A New Heuristic for Partitioning the Nodes of a Graph
• scientific article; zbMATH DE number 1241383
• scientific article; zbMATH DE number 2075198
• A discrete dynamic convexized method for VLSI circuit partitioning
• Engineering a direct \(k\)-way hypergraph partitioning algorithm

Cites work

• scientific article; zbMATH DE number 6378173 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• Multilevel refinement for combinatorial optimisation problems
• Scikit-learn: machine learning in Python
• Visualizing data using t-SNE

Describes a project that uses

Uses Software

• t-SNE
• Scikit

This page was built for publication: A method of improving initial partition of Fiduccia-Mattheyses algorithm

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