Frequent free tree discovery in graph data

@inproceedings{citeulike:1389534, address = {New York, NY, USA}, author = {R\&\#252;ckert, Ulrich and Kramer, Stefan }, booktitle = {SAC '04: Proceedings of the 2004 ACM symposium on Applied computing}, citeulike-article-id = {1389534}, doi = {http://dx.doi.org/10.1145/967900.968018}, isbn = {1581138121}, pages = {564--570}, posted-at = {2007-06-15 06:56:20}, priority = {2}, publisher = {ACM Press}, title = {Frequent free tree discovery in graph data}, url = {http://dx.doi.org/10.1145/967900.968018}, year = {2004} }

TY - CONF ID - citeulike:1389534 L3 - citeulike-article-id:1389534 TI - Frequent free tree discovery in graph data T2 - SAC '04: Proceedings of the 2004 ACM symposium on Applied computing SP - 564 EP - 570 AD - New York, NY, USA PB - ACM Press SN - 1581138121 AU - R\&\#252;ckert, Ulrich AU - Kramer, Stefan PY - 2004/// UR - http://dx.doi.org/10.1145/967900.968018 ER -