Scalable online betweenness centrality in evolving graphs

Nicolas Kourtellis, Gianmarco Morales, Francesco Bonchi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

10 Citations (Scopus)

Abstract

Betweenness centrality measures the importance of an element of a graph, either a vertex or an edge, by the fraction of shortest paths that pass through it [1]. This measure is notoriously expensive to compute, and the best known algorithm, proposed by Brandes [2], runs in O(nm) time. The problems of efficiency and scalability are exacerbated in a dynamic setting, where the input is an evolving graph seen edge by edge, and the goal is to keep the betweenness centrality up to date. In this paper [8] we propose the first truly scalable and practical framework for computing vertex and edge betweenness centrality of large evolving graphs, incrementally and online.

Original languageEnglish
Title of host publication2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages1580-1581
Number of pages2
ISBN (Electronic)9781509020195
DOIs
Publication statusPublished - 22 Jun 2016
Externally publishedYes
Event32nd IEEE International Conference on Data Engineering, ICDE 2016 - Helsinki, Finland
Duration: 16 May 201620 May 2016

Other

Other32nd IEEE International Conference on Data Engineering, ICDE 2016
CountryFinland
CityHelsinki
Period16/5/1620/5/16

Fingerprint

Scalability
Centrality
Betweenness
Graph
Shortest path
Pass-through

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Computer Graphics and Computer-Aided Design
  • Computer Networks and Communications
  • Information Systems
  • Information Systems and Management

Cite this

Kourtellis, N., Morales, G., & Bonchi, F. (2016). Scalable online betweenness centrality in evolving graphs. In 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016 (pp. 1580-1581). [7498421] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICDE.2016.7498421

Scalable online betweenness centrality in evolving graphs. / Kourtellis, Nicolas; Morales, Gianmarco; Bonchi, Francesco.

2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 1580-1581 7498421.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kourtellis, N, Morales, G & Bonchi, F 2016, Scalable online betweenness centrality in evolving graphs. in 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016., 7498421, Institute of Electrical and Electronics Engineers Inc., pp. 1580-1581, 32nd IEEE International Conference on Data Engineering, ICDE 2016, Helsinki, Finland, 16/5/16. https://doi.org/10.1109/ICDE.2016.7498421
Kourtellis N, Morales G, Bonchi F. Scalable online betweenness centrality in evolving graphs. In 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 1580-1581. 7498421 https://doi.org/10.1109/ICDE.2016.7498421
Kourtellis, Nicolas ; Morales, Gianmarco ; Bonchi, Francesco. / Scalable online betweenness centrality in evolving graphs. 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 1580-1581
@inproceedings{8d952b3f4da64d999db36ba83922737f,
title = "Scalable online betweenness centrality in evolving graphs",
abstract = "Betweenness centrality measures the importance of an element of a graph, either a vertex or an edge, by the fraction of shortest paths that pass through it [1]. This measure is notoriously expensive to compute, and the best known algorithm, proposed by Brandes [2], runs in O(nm) time. The problems of efficiency and scalability are exacerbated in a dynamic setting, where the input is an evolving graph seen edge by edge, and the goal is to keep the betweenness centrality up to date. In this paper [8] we propose the first truly scalable and practical framework for computing vertex and edge betweenness centrality of large evolving graphs, incrementally and online.",
author = "Nicolas Kourtellis and Gianmarco Morales and Francesco Bonchi",
year = "2016",
month = "6",
day = "22",
doi = "10.1109/ICDE.2016.7498421",
language = "English",
pages = "1580--1581",
booktitle = "2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Scalable online betweenness centrality in evolving graphs

AU - Kourtellis, Nicolas

AU - Morales, Gianmarco

AU - Bonchi, Francesco

PY - 2016/6/22

Y1 - 2016/6/22

N2 - Betweenness centrality measures the importance of an element of a graph, either a vertex or an edge, by the fraction of shortest paths that pass through it [1]. This measure is notoriously expensive to compute, and the best known algorithm, proposed by Brandes [2], runs in O(nm) time. The problems of efficiency and scalability are exacerbated in a dynamic setting, where the input is an evolving graph seen edge by edge, and the goal is to keep the betweenness centrality up to date. In this paper [8] we propose the first truly scalable and practical framework for computing vertex and edge betweenness centrality of large evolving graphs, incrementally and online.

AB - Betweenness centrality measures the importance of an element of a graph, either a vertex or an edge, by the fraction of shortest paths that pass through it [1]. This measure is notoriously expensive to compute, and the best known algorithm, proposed by Brandes [2], runs in O(nm) time. The problems of efficiency and scalability are exacerbated in a dynamic setting, where the input is an evolving graph seen edge by edge, and the goal is to keep the betweenness centrality up to date. In this paper [8] we propose the first truly scalable and practical framework for computing vertex and edge betweenness centrality of large evolving graphs, incrementally and online.

UR - http://www.scopus.com/inward/record.url?scp=84980320164&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84980320164&partnerID=8YFLogxK

U2 - 10.1109/ICDE.2016.7498421

DO - 10.1109/ICDE.2016.7498421

M3 - Conference contribution

SP - 1580

EP - 1581

BT - 2016 IEEE 32nd International Conference on Data Engineering, ICDE 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -