Graph algorithm based submodular function for sparsest cut problem

DOI10.1142/S0129054122460029MaRDI QIDQ6955231zbMATH OpenFDO

Authors Xiaoyan Zhang, Hong Chang, Longkun Guo, Donglei Du, Gaokai Zou, Yuanyuan Xiong

Publication date 23 July 2025

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

sparsitybipartitionsubmodular functionsparsest cut problemprincipal partition

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Expander graphs (05C48)

This page was built for publication: Graph algorithm based submodular function for sparsest cut problem

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