Volume 49, Issue 3September 2024Current IssueIssue-in-Progress
Skip Table Of Content Section
research-article
GraphZeppelin: How to Find Connected Components (Even When Graphs Are Dense, Dynamic, and Massive)
- David Tench,
- Evan West,
- Victor Zhang,
- Michael A. Bender,
- Abiyaz Chowdhury,
- Daniel Delayo,
- J. Ahmed Dellas,
- Martín Farach-Colton,
- Tyler Seip,
- Kenny Zhang
Finding the connected components of a graph is a fundamental problem with uses throughout computer science and engineering. The task of computing connected components becomes more difficult when graphs are very large, or when they are dynamic, meaning the ...
research-article
A Family of Centrality Measures for Graph Data Based on Subgraphs
We present the theoretical foundations and first experimental study of a new approach in centrality measures for graph data. The main principle is straightforward: the more relevant subgraphs around a vertex, the more central it is in the network. We ...
