Finding All Maximal Cliques in Dynamic Graphs. Stix, V. Computational Optimization and Applications, 27(2):173--186, February, 2004.
Finding All Maximal Cliques in Dynamic Graphs [link]Paper  doi  bibtex   
@article{ Stix2004,
  author = {Stix, Volker},
  doi = {10.1023/B:COAP.0000008651.28952.b6},
  file = {:Users/KunihiroWASA/Dropbox/paper/2004/Stix, Finding All Maximal Cliques in Dynamic Graphs, 2004.pdf:pdf},
  issn = {0926-6003},
  journal = {Computational Optimization and Applications},
  month = {February},
  number = {2},
  pages = {173--186},
  title = {{Finding All Maximal Cliques in Dynamic Graphs}},
  url = {http://link.springer.com/10.1023/B:COAP.0000008651.28952.b6},
  volume = {27},
  year = {2004}
}

Downloads: 0