Finding maximal cliques in massive networks by H*-graph

James Cheng, Yiping Ke, Ada Wai-Chee Fu, Jeffrey Xu Yu, Linhong Zhu. Finding maximal cliques in massive networks by H*-graph. In Ahmed K. Elmagarmid, Divyakant Agrawal, editors, Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010. pages 447-458, ACM, 2010. [doi]

@inproceedings{ChengKFYZ10,
  title = {Finding maximal cliques in massive networks by H*-graph},
  author = {James Cheng and Yiping Ke and Ada Wai-Chee Fu and Jeffrey Xu Yu and Linhong Zhu},
  year = {2010},
  doi = {10.1145/1807167.1807217},
  url = {http://doi.acm.org/10.1145/1807167.1807217},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/ChengKFYZ10},
  cites = {0},
  citedby = {0},
  pages = {447-458},
  booktitle = {Proceedings of the ACM SIGMOD International Conference on Management of Data, SIGMOD 2010, Indianapolis, Indiana, USA, June 6-10, 2010},
  editor = {Ahmed K. Elmagarmid and Divyakant Agrawal},
  publisher = {ACM},
  isbn = {978-1-4503-0032-2},
}