Bron-Kerbosch implementation w/ Tomita pivot rule and degeneracy based ordering [1]
[1] D. Eppstein, M. Löffler, and D. Strash. Listing all maximal cliques in sparse graphs in near-optimal time. In O. Cheong, K.-Y. Chwa, and K. Park, editors, Algorithms and Computation, volume 6506 of Lecture Notes in Computer Science, pages 403–414. Springer Berlin Heidelberg, 2010.