Recent advances in fully dynamic graph algorithms–a quick reference guide
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Centrality measures in complex networks: A survey
In complex networks, each node has some unique characteristics that define the importance
of the node based on the given application-specific context. These characteristics can be …
of the node based on the given application-specific context. These characteristics can be …
Recent advances in fully dynamic graph algorithms
In recent years, significant advances have been made in the design and analysis of fully
dynamic algorithms. However, these theoretical results have received very little attention …
dynamic algorithms. However, these theoretical results have received very little attention …
Efficient computation of the Shapley value for game-theoretic network centrality
The Shapley value---probably the most important normative payoff division scheme in
coalitional games---has recently been advocated as a useful measure of centrality in …
coalitional games---has recently been advocated as a useful measure of centrality in …
CoolCAMs: Power-efficient TCAMs for forwarding engines
F Zane, G Narlikar, A Basu - IEEE INFOCOM 2003. Twenty …, 2003 - ieeexplore.ieee.org
Ternary content-addressable memories (TCAMs) are becoming very popular for designing
high-throughput forwarding engines on routers: they are fast, cost-effective and simple to …
high-throughput forwarding engines on routers: they are fast, cost-effective and simple to …
Abra: Approximating betweenness centrality in static and dynamic graphs with rademacher averages
M Riondato, E Upfal - ACM Transactions on Knowledge Discovery from …, 2018 - dl.acm.org
ABPA Ξ A Σ (ABRAXAS): Gnostic word of mystic meaning. We present ABRA, a suite of
algorithms to compute and maintain probabilistically guaranteed high-quality …
algorithms to compute and maintain probabilistically guaranteed high-quality …
Graph neural networks for fast node ranking approximation
Graphs arise naturally in numerous situations, including social graphs, transportation
graphs, web graphs, protein graphs, etc. One of the important problems in these settings is …
graphs, web graphs, protein graphs, etc. One of the important problems in these settings is …
Structural analysis and the sum of nodes' betweenness centrality in complex networks
Structural analysis in the field of network science aims to uncover the hidden information
embedded within the topological structure of complex networks. Betweenness centrality is a …
embedded within the topological structure of complex networks. Betweenness centrality is a …
Scalable online betweenness centrality in evolving graphs
N Kourtellis, GDF Morales… - IEEE Transactions on …, 2015 - ieeexplore.ieee.org
Betweenness centrality is a classic measure that quantifies the importance of a graph
element (vertex or edge) according to the fraction of shortest paths passing through it. This …
element (vertex or edge) according to the fraction of shortest paths passing through it. This …
Hop doubling label indexing for point-to-point distance querying on scale-free networks
We study the problem of point-to-point distance querying for massive scale-free graphs,
which is important for numerous applications. Given a directed or undirected graph, we …
which is important for numerous applications. Given a directed or undirected graph, we …