scientific article; zbMATH DE number 6917138

DOI10.4230/LIPIcs.SEA.2017.23zbMath1433.68277arXiv1704.08592MaRDI QIDQ4580179

Elisabetta Bergamini, Henning Meyerhenke, Mark Ortmann, Arie Slobbe

Publication date: 13 August 2018

Full work available at URL: https://arxiv.org/abs/1704.08592

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

distancesshortest pathsgraph algorithmsdynamic algorithms

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Improving the Betweenness Centrality of a Node by Adding Links ⋮ Computing Betweenness Centrality in Link Streams ⋮ KADABRA is an ADaptive Algorithm for Betweenness via Random Approximation ⋮ Optimizing node infiltrations in complex networks by a local search based heuristic

This page was built for publication: