Testability of minimum balanced multiway cut densities
Discrete Applied Mathematics（2012）
摘要
Testability of certain balanced minimum multiway cut densities is investigated for vertex- and edge-weighted graphs with no dominant vertex-weights. We apply the results for fuzzy clustering and noisy graph sequences.
更多查看译文
关键词
certain balanced minimum multiway,edge-weighted graph,minimum balanced multiway cut,quadratic programming,minimum balanced multiway cuts,62h30,testable graph parameters,weighted graphs,68r10,fuzzy clustering,wigner-noise 1991 msc: 05c35,noisy graph sequence,dominant vertex-weights,cut density,quadratic program,cluster analysis,statistical physics
AI 理解论文
溯源树
样例
生成溯源树，研究论文发展脉络
Chat Paper
正在生成论文摘要