%0 Journal Article %1 journals/tcs/HorvathR10 %A Horváth, Tamás %A Ramon, Jan %D 2010 %J Theor. Comput. Sci. %K %N 31-33 %P 2784-2797 %T Efficient frequent connected subgraph mining in graphs of bounded tree-width. %U http://dblp.uni-trier.de/db/journals/tcs/tcs411.html#HorvathR10 %V 411

@article{journals/tcs/HorvathR10, added-at = {2023-12-12T19:21:29.000+0100}, author = {Horváth, Tamás and Ramon, Jan}, biburl = {https://www.bibsonomy.org/bibtex/21f4d1efe3e85b6bb09ac0f7d68a5c4c4/admin}, ee = {https://doi.org/10.1016/j.tcs.2010.03.030}, interhash = {1f8066963af78e09a018ae016fff942e}, intrahash = {1f4d1efe3e85b6bb09ac0f7d68a5c4c4}, journal = {Theor. Comput. Sci.}, keywords = {}, number = {31-33}, pages = {2784-2797}, timestamp = {2023-12-12T19:21:29.000+0100}, title = {Efficient frequent connected subgraph mining in graphs of bounded tree-width.}, url = {http://dblp.uni-trier.de/db/journals/tcs/tcs411.html#HorvathR10}, volume = 411, year = 2010 }