@article{Akkoyunlu1973, 
     author = "Akkoyunlu, E. A.", 
     doi = "10.1137/0202001", 
     issn = "0097-5397", 
     journal = "SIAM Journal on Computing", 
     keyword = "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", 
     link = "http://epubs.siam.org/doi/abs/10.1137/0202001", 
     month = "mar", 
     number = "1", 
     pages = "1--6", 
     title = "The Enumeration of Maximal Cliques of Large Graphs", 
     uri = "http://epubs.siam.org/doi/abs/10.1137/0202001", 
     volume = "2", 
     year = "1973", 
}

Problems: 33