Publisher
Institute of Mathematics, Czech Academy of Sciences
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. PSMC: Provable and Scalable Algorithms for Motif Conductance Based Graph Clustering;Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining;2024-08-24
2. Nearly k-Distance Sets;Discrete & Computational Geometry;2023-06-06
3. Maximal chordal subgraphs;Combinatorics, Probability and Computing;2023-05-02
4. On stability of the Erdős–Rademacher problem;Illinois Journal of Mathematics;2023-04-01
5. Complete subgraphs in connected graphs and its application to spectral moment;Discrete Applied Mathematics;2021-03