Kevin Durant, Stephan Wagner. Betweenness Centrality in Random Trees. In James Allen Fill, Mark Daniel Ward, editors, Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016. pages 66-79, SIAM, 2016. [doi]
@inproceedings{DurantW16,
title = {Betweenness Centrality in Random Trees},
author = {Kevin Durant and Stephan Wagner},
year = {2016},
doi = {10.1137/1.9781611974324.8},
url = {http://dx.doi.org/10.1137/1.9781611974324.8},
researchr = {https://researchr.org/publication/DurantW16},
cites = {0},
citedby = {0},
pages = {66-79},
booktitle = {Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2016, Arlington, Virginia, USA, January 11, 2016},
editor = {James Allen Fill and Mark Daniel Ward},
publisher = {SIAM},
isbn = {978-1-61197-432-4},
}