In this and the next three chapters, we study the problem of graph partitioning, which deals with the question of how to divide up the nodes into homogeneous groups (if they exist). This topic is currently receiving the greater part of research activity within the network science community. In this chapter, we describe various methods for graph partitioning using graph cuts, including binary cuts, ratio cuts, normalized cuts, and multiway cuts.
Review the options below to login to check your access.
Log in with your Cambridge Aspire website account to check access.
If you believe you should have access to this content, please contact your institutional librarian or consult our FAQ page for further information about accessing our content.