@InProceedings{dreier_et_al:LIPIcs.FSTTCS.2019.13,
author = {Dreier, Jan and Rossmanith, Peter},
title = {{Motif Counting in Preferential Attachment Graphs}},
booktitle = {39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019)},
pages = {13:1--13:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-131-3},
ISSN = {1868-8969},
year = {2019},
volume = {150},
editor = {Chattopadhyay, Arkadev and Gastin, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.FSTTCS.2019.13},
URN = {urn:nbn:de:0030-drops-115750},
doi = {10.4230/LIPIcs.FSTTCS.2019.13},
annote = {Keywords: random graphs, motif counting, average case analysis, preferential attachment graphs}
}