@article{ Alon1997,
  abstract = {We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results.},
  author = {Alon, N and Yuster, R. and Zwick, U.},
  doi = {10.1007/BF02523189},
  file = {:Users/KunihiroWASA/Dropbox/paper/1997/Alon, Yuster, Zwick, Finding and counting given length cycles, 1997.pdf:pdf},
  issn = {0178-4617},
  journal = {Algorithmica},
  keywords = {1,a i n s,a simple cycle of,c o n t,clearly np-,cycles,d e c i,d i n g,e,e m o f,easily stated algorithmic graph,g i v e,graph algorithms,h e r a,i n t r,if the cycle length,k is part of,length k is among,n g r a,o d u c,p h g,problems,r o b l,t h e p,t i o n,the input,the most natural and,then the problem is,v,w h e t},
  month = {March},
  number = {3},
  pages = {209--223},
  title = {{Finding and counting given length cycles}},
  url = {http://link.springer.com/10.1007/BF02523189},
  volume = {17},
  year = {1997}
}

{"_id":"56tteaJeaBkKRzL62","authorIDs":[],"author_short":["Alon, N","Yuster, R.","Zwick, U."],"bibbaseid":"alon-yuster-zwick-findingandcountinggivenlengthcycles-1997","bibdata":{"abstract":"We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results.","author":["Alon, N","Yuster, R.","Zwick, U."],"author_short":["Alon, N","Yuster, R.","Zwick, U."],"bibtex":"@article{ Alon1997,\n abstract = {We present an assortment of methods for finding and counting simple cycles of a given length in directed and undirected graphs. Most of the bounds obtained depend solely on the number of edges in the graph in question, and not on the number of vertices. The bounds obtained improve upon various previously known results.},\n author = {Alon, N and Yuster, R. and Zwick, U.},\n doi = {10.1007/BF02523189},\n file = {:Users/KunihiroWASA/Dropbox/paper/1997/Alon, Yuster, Zwick, Finding and counting given length cycles, 1997.pdf:pdf},\n issn = {0178-4617},\n journal = {Algorithmica},\n keywords = {1,a i n s,a simple cycle of,c o n t,clearly np-,cycles,d e c i,d i n g,e,e m o f,easily stated algorithmic graph,g i v e,graph algorithms,h e r a,i n t r,if the cycle length,k is part of,length k is among,n g r a,o d u c,p h g,problems,r o b l,t h e p,t i o n,the input,the most natural and,then the problem is,v,w h e t},\n month = {March},\n number = {3},\n pages = {209--223},\n title = {{Finding and counting given length cycles}},\n url = {http://link.springer.com/10.1007/BF02523189},\n volume = {17},\n year = {1997}\n}","bibtype":"article","doi":"10.1007/BF02523189","file":":Users/KunihiroWASA/Dropbox/paper/1997/Alon, Yuster, Zwick, Finding and counting given length cycles, 1997.pdf:pdf","id":"Alon1997","issn":"0178-4617","journal":"Algorithmica","key":"Alon1997","keywords":"1,a i n s,a simple cycle of,c o n t,clearly np-,cycles,d e c i,d i n g,e,e m o f,easily stated algorithmic graph,g i v e,graph algorithms,h e r a,i n t r,if the cycle length,k is part of,length k is among,n g r a,o d u c,p h g,problems,r o b l,t h e p,t i o n,the input,the most natural and,then the problem is,v,w h e t","month":"March","number":"3","pages":"209--223","title":"Finding and counting given length cycles","type":"article","url":"http://link.springer.com/10.1007/BF02523189","volume":"17","year":"1997","bibbaseid":"alon-yuster-zwick-findingandcountinggivenlengthcycles-1997","role":"author","urls":{"Paper":"http://link.springer.com/10.1007/BF02523189"},"keyword":["1","a i n s","a simple cycle of","c o n t","clearly np-","cycles","d e c i","d i n g","e","e m o f","easily stated algorithmic graph","g i v e","graph algorithms","h e r a","i n t r","if the cycle length","k is part of","length k is among","n g r a","o d u c","p h g","problems","r o b l","t h e p","t i o n","the input","the most natural and","then the problem is","v","w h e t"],"downloads":0,"html":""},"bibtype":"article","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.073Z","downloads":0,"keywords":["1","a i n s","a simple cycle of","c o n t","clearly np-","cycles","d e c i","d i n g","e","e m o f","easily stated algorithmic graph","g i v e","graph algorithms","h e r a","i n t r","if the cycle length","k is part of","length k is among","n g r a","o d u c","p h g","problems","r o b l","t h e p","t i o n","the input","the most natural and","then the problem is","v","w h e t"],"search_terms":["finding","counting","given","length","cycles","alon","yuster","zwick"],"title":"Finding and counting given length cycles","year":1997,"dataSources":["YRMeqhMHoNu9HzJoC"]}