@InProceedings{ito:LIPIcs.ESA.2016.51,
author = {Ito, Hiro},
title = {{Every Property Is Testable on a Natural Class of Scale-Free Multigraphs}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {51:1--51:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Sankowski, Piotr and Zaroliagis, Christos},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ESA.2016.51},
URN = {urn:nbn:de:0030-drops-63937},
doi = {10.4230/LIPIcs.ESA.2016.51},
annote = {Keywords: constant-time algorithms, scale-free networks, complex networks, isolated cliques, hyperfinite}
}