Combinatorial Solution to the Partitioning of General Graphs

DOI10.1147/RD.192.0170MaRDI QIDQ4055188zbMATH OpenOpenAlexFDO

Authors J. A. Lukes

Publication date 1975

Published in IBM Journal of Research and Development (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1147/rd.192.0170

Mathematics Subject Classification ID

Algorithms in computer science (68W99)

Cited in

(3)

• An effective structured approach to finding optimal partitions of networks
• A survey of constrained classification
• The optimal graph partitioning problem. Solution method based on reducing symmetric nature and combinatorial cuts

This page was built for publication: Combinatorial Solution to the Partitioning of General Graphs

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