1 citations · 1 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Efficient maximal cliques enumeration in weakly closed graphs
George Manoussakis
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…
cs.DS2019
The Bron-Kerbosch Algorithm with Vertex Ordering is Output-Sensitive
George Manoussakis
The Bron-Kerbosch algorithm is a well known maximal clique enumeration algorithm. So far it was unknown whether it was output sensitive or not. In this paper we partially answer th…