Towards Optimal Output-Sensitive Clique Listing or: Listing Cliques from Smaller Cliques
STOC ’24, June 24–28, 2024, Vancouver, BC, Canada
Main Authors: | Dalirrooyfard, Mina, Mathialagan, Surya, Williams, Virginia Vassilevska, Xu, Yinzhan |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
ACM|Proceedings of the 56th Annual ACM Symposium on Theory of Computing
2024
|
Online Access: | https://hdl.handle.net/1721.1/155717 |
Similar Items
-
Clique covers of H-free graphs
by: Nguyen, T, et al.
Published: (2023) -
On the clique number of a strongly regular graph
by: Greaves, Gary Royden Watson, et al.
Published: (2021) -
Multivariate central limit theorems for random clique complexes
by: Temčinas, T, et al.
Published: (2023) -
Hardness of Approximate Diameter: Now for Undirected Graphs
by: Dalirrooyfard, Mina, et al.
Published: (2024) -
Reconstruction from smaller cards
by: Groenland, C, et al.
Published: (2021)