Listing All Maximal Cliques in Large Sparse Real-World Graphs

David Eppstein, Darren Strash. Listing All Maximal Cliques in Large Sparse Real-World Graphs. In Panos M. Pardalos, Steffen Rebennack, editors, Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings. Volume 6630 of Lecture Notes in Computer Science, pages 364-375, Springer, 2011. [doi]

@inproceedings{EppsteinS11,
  title = {Listing All Maximal Cliques in Large Sparse Real-World Graphs},
  author = {David Eppstein and Darren Strash},
  year = {2011},
  doi = {10.1007/978-3-642-20662-7_31},
  url = {http://dx.doi.org/10.1007/978-3-642-20662-7_31},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/EppsteinS11},
  cites = {0},
  citedby = {0},
  pages = {364-375},
  booktitle = {Experimental Algorithms - 10th International Symposium, SEA 2011, Kolimpari, Chania, Crete, Greece, May 5-7, 2011. Proceedings},
  editor = {Panos M. Pardalos and Steffen Rebennack},
  volume = {6630},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-20661-0},
}