@inproceedings{ Okamoto2005a,
  address = {Metz, France},
  author = {Okamoto, Y and Uno, T and Uehara, R},
  booktitle = {WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science},
  doi = {10.1007/11604686_38},
  editor = {Kratsch, Dieter},
  file = {:Users/KunihiroWASA/Dropbox/paper/2005/Okamoto, Uno, Uehara, Linear time counting algorithms for independent sets in chordal graphs, 2005.pdf:pdf},
  keywords = {chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm},
  month = {June},
  pages = {433--444},
  publisher = {Springer Berlin Heidelberg},
  series = {Lecture Notes in Computer Science},
  title = {{Linear time counting algorithms for independent sets in chordal graphs}},
  url = {http://link.springer.com/chapter/10.1007/11604686_38},
  volume = {3787},
  year = {2005}
}

{"_id":"EgBqTRiN67SZeLxLj","authorIDs":[],"author_short":["Okamoto, Y","Uno, T","Uehara, R"],"bibbaseid":"okamoto-uno-uehara-lineartimecountingalgorithmsforindependentsetsinchordalgraphs-2005","bibdata":{"address":"Metz, France","author":["Okamoto, Y","Uno, T","Uehara, R"],"author_short":["Okamoto, Y","Uno, T","Uehara, R"],"bibtex":"@inproceedings{ Okamoto2005a,\n address = {Metz, France},\n author = {Okamoto, Y and Uno, T and Uehara, R},\n booktitle = {WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science},\n doi = {10.1007/11604686_38},\n editor = {Kratsch, Dieter},\n file = {:Users/KunihiroWASA/Dropbox/paper/2005/Okamoto, Uno, Uehara, Linear time counting algorithms for independent sets in chordal graphs, 2005.pdf:pdf},\n keywords = {chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm},\n month = {June},\n pages = {433--444},\n publisher = {Springer Berlin Heidelberg},\n series = {Lecture Notes in Computer Science},\n title = {{Linear time counting algorithms for independent sets in chordal graphs}},\n url = {http://link.springer.com/chapter/10.1007/11604686_38},\n volume = {3787},\n year = {2005}\n}","bibtype":"inproceedings","booktitle":"WG 2005: the 31st International Workshop on Graph-Theoretic Concepts in Computer Science","doi":"10.1007/11604686_38","editor":["Kratsch, Dieter"],"editor_short":["Kratsch, D."],"file":":Users/KunihiroWASA/Dropbox/paper/2005/Okamoto, Uno, Uehara, Linear time counting algorithms for independent sets in chordal graphs, 2005.pdf:pdf","id":"Okamoto2005a","key":"Okamoto2005a","keywords":"chordal graph,completeness,counting,enumeration,independent set,np-,p-completeness,polynomial time algorithm","month":"June","pages":"433--444","publisher":"Springer Berlin Heidelberg","series":"Lecture Notes in Computer Science","title":"Linear time counting algorithms for independent sets in chordal graphs","type":"inproceedings","url":"http://link.springer.com/chapter/10.1007/11604686_38","volume":"3787","year":"2005","bibbaseid":"okamoto-uno-uehara-lineartimecountingalgorithmsforindependentsetsinchordalgraphs-2005","role":"author","urls":{"Paper":"http://link.springer.com/chapter/10.1007/11604686_38"},"keyword":["chordal graph","completeness","counting","enumeration","independent set","np-","p-completeness","polynomial time algorithm"],"downloads":0,"html":""},"bibtype":"inproceedings","biburl":"http://www-ikn.ist.hokudai.ac.jp/~wasa/enum.bib","creationDate":"2015-04-23T04:51:45.395Z","downloads":0,"keywords":["chordal graph","completeness","counting","enumeration","independent set","np-","p-completeness","polynomial time algorithm"],"search_terms":["linear","time","counting","algorithms","independent","sets","chordal","graphs","okamoto","uno","uehara"],"title":"Linear time counting algorithms for independent sets in chordal graphs","year":2005,"dataSources":["YRMeqhMHoNu9HzJoC"]}