Testing higher-order clusterability on graphs

DOI10.1007/978-3-031-49614-1_15MaRDI QIDQ6606232FDOQ6606232

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

• Random graph models of social networks
• Robust Characterizations of Polynomials with Applications to Program Testing
• On clusterings: good, bad and spectral
• Partitioning into expanders
• Title not available (Why is that?)
• Testing Expansion in Bounded-Degree Graphs
• An expansion tester for bounded degree graphs
• Testing cluster structure of graphs
• High dimensional random walks and colorful expansion
• On sampling edges almost uniformly
• Title not available (Why is that?)

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)