Finding k-highest betweenness centrality vertices in graphs.
| Anthology ID: | DBLP:conf/www/LeeC14 |
|---|---|
| Volume: | 23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume |
| Year: | 2014 |
| Venue: | The Web Conference (WWW) |
| Publisher: | ACM |
| Pages: | 339-340 |
| URL: | https://doi.org/10.1145/2567948.2577358 |
| DOI: | https://doi.org/10.1145/2567948.2577358 |
| DBLP: | conf/www/LeeC14 |
| BibTeX: |
@inproceedings{lee-2014-finding,
author = {Min-Joong Lee and
Chin-Wan Chung},
editor = {Chin-Wan Chung and
Andrei Z. Broder and
Kyuseok Shim and
Torsten Suel},
title = {{Finding k-highest betweenness centrality vertices in graphs}},
booktitle = {{23rd International World Wide Web Conference, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume}},
pages = {339--340},
publisher = {ACM},
year = {2014},
url = {https://doi.org/10.1145/2567948.2577358},
doi = {https://doi.org/10.1145/2567948.2577358}
}