Scalable computational techniques for centrality metrics on temporally detailed social network
type: Item
instance of: scholarly article
title: Scalable computational techniques for centrality metrics on temporally detailed social network
zbMATH Open document ID: 1457.91307
author: Venkata M. V. Gunturi
author: Shashi Shekhar
author: Kenneth Joseph
author: Kathleen M. Carley
published in: Machine Learning
publication date: 2018-01-05T00:00:00Z
Mathematics Subject Classification ID: 91D30
zbMATH DE Number: 6822884
zbMATH Keywords: dynamic programming
zbMATH Keywords: time-varying social networks
zbMATH Keywords: time varying networks
zbMATH Keywords: graph theory
zbMATH Keywords: centrality
Wikidata QID: Q63170049
describes a project that uses: igraph
MaRDI profile type: Publication
full work available at URL: s10994-016-5583-7
OpenAlex ID: W2514062356
cites work: Q3795523
cites work: A faster algorithm for betweenness centrality*
cites work: Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information
cites work: Introduction to algorithms
cites work: Time-Dependent SHARC-Routing
cites work: Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
cites work: Time-Dependent Route Planning
cites work: Entropy of dialogues creates coherent structures in e-mail traffic
cites work: Empirical Analysis of an Evolving Social Network
cites work: Bidirectional A ∗ Search for Time-Dependent Fast Paths
cites work: Bidirectional \(A^*\) search on time-dependent road networks
cites work: The centrality index of a graph
DOI: 10.1007/S10994-016-5583-7
description: scientific article; zbMATH DE number 6822884