Testing higher-order clusterability on graphs

DOI10.1007/S10878-025-01262-XMaRDI QIDQ6991811zbMATH OpenFDO

Authors Yifei Li, Donghua Yang, Jianzhong Li

Publication date 28 April 2025

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10878-025-01262-X

zbMATH Keywords

spectral graph theoryproperty testingdual graphhigher-order clustering

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites work

• High dimensional random walks and colorful expansion
• On clusterings: good, bad and spectral
• On sampling edges almost uniformly
• Partitioning into expanders
• Random graph models of social networks
• Robust Characterizations of Polynomials with Applications to Program Testing
• Testing cluster structure of graphs
• Testing graph clusterability: algorithms and lower bounds

This page was built for publication: Testing higher-order clusterability on graphs

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