Testing higher-order clusterability on graphs

DOI10.1007/978-3-031-49614-1_15MaRDI QIDQ6606232zbMATH OpenFDO

Authors Yifei Li, Donghua Yang, Jianzhong Li

Publication date 16 September 2024

zbMATH Keywords

spectral graph theoryproperty testinghigh dimensional expanderhigher-order clustering

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• scientific article; zbMATH DE number 1559556 (Why is no real title available?)
• scientific article; zbMATH DE number 7788435 (Why is no real title available?)
• An expansion tester for bounded degree graphs
• 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 Expansion in Bounded-Degree Graphs
• Testing cluster structure of graphs

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 Q6606232)