%0 Journal Article %1 journals/tkde/AugstenBBP11 %A Augsten, Nikolaus %A Barbosa, Denilson %A Böhlen, Michael H. %A Palpanas, Themis %D 2011 %J IEEE Trans. Knowl. Data Eng. %K dblp %N 8 %P 1123-1137 %T Efficient Top-k Approximate Subtree Matching in Small Memory. %U http://dblp.uni-trier.de/db/journals/tkde/tkde23.html#AugstenBBP11 %V 23

@article{journals/tkde/AugstenBBP11, added-at = {2023-01-13T00:00:00.000+0100}, author = {Augsten, Nikolaus and Barbosa, Denilson and Böhlen, Michael H. and Palpanas, Themis}, biburl = {https://www.bibsonomy.org/bibtex/2f053133c8f7861f9d4517c54642aa5c3/dblp}, ee = {http://doi.ieeecomputersociety.org/10.1109/TKDE.2010.245}, interhash = {ff49f3ddc7fada79302401cec3f64dc9}, intrahash = {f053133c8f7861f9d4517c54642aa5c3}, journal = {IEEE Trans. Knowl. Data Eng.}, keywords = {dblp}, number = 8, pages = {1123-1137}, timestamp = {2024-04-08T21:40:16.000+0200}, title = {Efficient Top-k Approximate Subtree Matching in Small Memory.}, url = {http://dblp.uni-trier.de/db/journals/tkde/tkde23.html#AugstenBBP11}, volume = 23, year = 2011 }