Edge-Cuts of Optimal Average Weights

DOI10.1142/S0217595919400062MaRDI QIDQ5384747zbMATH OpenOpenAlexFDO

Authors Scott Payne, Edgar Fuller, Cun-Quan Zhang

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

algorithmaverage weightclusteringcommunity selectionoptimal edge-cut

Mathematics Subject Classification ID

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

Recommendations

• Lower Bounds for Maximum Weighted Cut
• Graph cuts with interacting edge weights: examples, approximations, and algorithms
• Optimal algorithms for computing edge weights in planar split networks
• Complexity of the weighted max-cut in Euclidean space
• Optimal graphon estimation in cut distance
• scientific article; zbMATH DE number 2190098
• Generalized cut method for computing the edge-Wiener index
• The average cut-rank of graphs
• Faster cut sparsification of weighted graphs
• On a max-min problem concerning weights of edges

Cites work

• A new approach to the maximum-flow problem
• Graph theory with applications
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• Introduction to algorithms.
• Maximal Flow Through a Network
• Reducibility among combinatorial problems

Cited in

(1)

• Spectrum Consistent Coarsening Approximates Edge Weights

Describes a project that uses

Uses Software

• SAS
• SAS/STAT

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

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