Emergent Mind
Efficient maximal cliques enumeration in weakly closed graphs
(2303.02390)
Published Mar 4, 2023
in
cs.DS
Abstract
We show that the algorithm presented in [J. Fox, T. Roughgarden, C. Seshadhri, F. Wei, and N. Wein. Finding cliques in social networks: A new distribution-free model. SIAM journal on computing, 49(2):448-464, 2020.] can be modified to have enumeration time complexity $\alpha\mathcal{O} (npoly(c))$. Here parameter $c$ is the weakly closure of the graph and $\alpha$ its number of maximal cliques. This result improves on their complexity which was not output sensitive and exponential in the closure of the graph.
We're not able to analyze this paper right now due to high demand.
Please check back later (sorry!).
Generate a summary of this paper on our Pro plan:
We ran into a problem analyzing this paper.