New Algorithms for Enumerating All Maximal Cliques

By Kazuhisa Makino, Takeaki Uno. Scandinavian Workshop on Algorithm Theory, 2004

453 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/a2f399ff1e3eb74cd813c8beb87816fced0af759

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. David Eppstein
2. Darren Strash
3. James Cheng
4. Jia Wang
5. Brian Scassellati
6. Bradley Hayes
7. Biswanath Mukherjee
8. Eiman Mohammed Alotaibi

In Computer Networks and Communications

1. David Eppstein
2. Darren Strash
3. Maarten Löffler
4. Brian Scassellati
5. Bradley Hayes

Citations in the corpus

• Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time (2010, background): “Many algorithms are now known for this problem [1,7,9,10,11,23,28,32,41,43,47] and for the complementary problem of finding maximal independent sets [16,31,37,39,48].”