@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}
}

{"_id":"bvig6Td5Zfx9rK4hZ","authorIDs":[],"author_short":["Akkoyunlu, E.<nbsp>A."],"bibbaseid":"akkoyunlu-theenumerationofmaximalcliquesoflargegraphs-1973","bibdata":{"author":["Akkoyunlu, E. A."],"author_short":["Akkoyunlu, E.<nbsp>A."],"bibtex":"@article{ Akkoyunlu1973,\n author = {Akkoyunlu, E. A.},\n doi = {10.1137/0202001},\n file = {:Users/KunihiroWASA/Dropbox/paper/1973/Akkoyunlu, The Enumeration of Maximal Cliques of Large Graphs, 1973.pdf:pdf},\n issn = {0097-5397},\n journal = {SIAM Journal on Computing},\n 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},\n month = {March},\n number = {1},\n pages = {1--6},\n title = {{The Enumeration of Maximal Cliques of Large Graphs}},\n url = {http://epubs.siam.org/doi/abs/10.1137/0202001},\n volume = {2},\n year = {1973}\n}","bibtype":"article","doi":"10.1137/0202001","file":":Users/KunihiroWASA/Dropbox/paper/1973/Akkoyunlu, The Enumeration of Maximal Cliques of Large Graphs, 1973.pdf:pdf","id":"Akkoyunlu1973","issn":"0097-5397","journal":"SIAM Journal on Computing","key":"Akkoyunlu1973","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","type":"article","url":"http://epubs.siam.org/doi/abs/10.1137/0202001","volume":"2","year":"1973","bibbaseid":"akkoyunlu-theenumerationofmaximalcliquesoflargegraphs-1973","role":"author","urls":{"Paper":"http://epubs.siam.org/doi/abs/10.1137/0202001"},"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"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:44.717Z","downloads":0,"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"],"search_terms":["enumeration","maximal","cliques","large","graphs","akkoyunlu"],"title":"The Enumeration of Maximal Cliques of Large Graphs","year":1973,"dataSources":["YRMeqhMHoNu9HzJoC"]}