BibTeX record journals/tcs/HorvathR10

download as .bib file

@article{DBLP:journals/tcs/HorvathR10,
  author    = {Tam{\'{a}}s Horv{\'{a}}th and
               Jan Ramon},
  title     = {Efficient frequent connected subgraph mining in graphs of bounded
               tree-width},
  journal   = {Theor. Comput. Sci.},
  volume    = {411},
  number    = {31-33},
  pages     = {2784--2797},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.tcs.2010.03.030},
  doi       = {10.1016/j.tcs.2010.03.030},
  timestamp = {Tue, 19 Mar 2019 14:27:57 +0100},
  biburl    = {https://dblp.org/rec/bib/journals/tcs/HorvathR10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics