The Enumeration of Maximal Cliques of Large Graphs. Akkoyunlu, E. A. SIAM Journal on Computing, 2(1):1--6, March, 1973.
The Enumeration of Maximal Cliques of Large Graphs [link]Paper  doi  bibtex   
@article{ Akkoyunlu1973,
  author = {Akkoyunlu, E. A.},
  doi = {10.1137/0202001},
  file = {:Users/KunihiroWASA/Dropbox/paper/1973/Akkoyunlu, The Enumeration of Maximal Cliques of Large Graphs, 1973.pdf:pdf},
  issn = {0097-5397},
  journal = {SIAM Journal on Computing},
  keywords = {1,algorithms,clique,e the set of,edges,enumeration,fig,g,graph,identify completely connected subgraphs,if so is the,introduction,is best formulated in,of an undirected graph,or cliques,set of nodes and,terms,the goal is to,the problem considered here,which are},
  month = {March},
  number = {1},
  pages = {1--6},
  title = {{The Enumeration of Maximal Cliques of Large Graphs}},
  url = {http://epubs.siam.org/doi/abs/10.1137/0202001},
  volume = {2},
  year = {1973}
}

Downloads: 0