Edge-Cuts of Optimal Average Weights

DOI10.1142/S0217595919400062zbMath1415.90139OpenAlexW2943996658MaRDI QIDQ5384747

Edgar Fuller, Cun-Quan Zhang, Scott Payne

Publication date: 25 June 2019

Published in: Asia-Pacific Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0217595919400062

zbMATH Keywords

algorithmclusteringaverage weightcommunity selectionoptimal edge-cut

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Clustering in the social and behavioral sciences (91C20)

Uses Software

• SAS
• SAS/STAT

Cites Work

• Maximal Flow Through a Network
• A new approach to the maximum-flow problem
• Reducibility among Combinatorial Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Edge-Cuts of Optimal Average Weights