pdfformat: 

@InProceedings{bentert_et_al:LIPIcs:2018:9984, author = {Matthias Bentert and Alexander Dittmann and Leon Kellerhals and Andr{\'e} Nichterlein and Rolf Niedermeier}, title = {{An Adaptive Version of Brandes' Algorithm for Betweenness Centrality}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {36:136:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959770941}, ISSN = {18688969}, year = {2018}, volume = {123}, editor = {WenLian Hsu and DerTsai Lee and ChungShou Liao}, publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik}, address = {Dagstuhl, Germany}, URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9984}, URN = {urn:nbn:de:0030drops99846}, doi = {10.4230/LIPIcs.ISAAC.2018.36}, annote = {Keywords: network science, social network analysis, centrality measures, shortest paths, treelike graphs, efficient pre and postprocessing, FPT in P} }
Keywords:  network science, social network analysis, centrality measures, shortest paths, treelike graphs, efficient pre and postprocessing, FPT in P  
Seminar:  29th International Symposium on Algorithms and Computation (ISAAC 2018)  
Issue date:  2018  
Date of publication:  2018 