Combinatorial Solution to the Partitioning of General Graphs

DOI10.1147/rd.192.0170zbMath0301.68052OpenAlexW2127779753MaRDI QIDQ4055188

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)

Related Items (3)

A survey of constrained classification ⋮ An effective structured approach to finding optimal partitions of networks ⋮ 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