Scalable computational techniques for centrality metrics on temporally detailed social network
From MaRDI portal
Publication:1688418
DOI10.1007/s10994-016-5583-7zbMath1457.91307OpenAlexW2514062356WikidataQ63170049 ScholiaQ63170049MaRDI QIDQ1688418
Shashi Shekhar, Kathleen M. Carley, Venkata M. V. Gunturi, Kenneth Joseph
Publication date: 5 January 2018
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-016-5583-7
Related Items (3)
Towards classifying the polynomial-time solvability of temporal betweenness centrality ⋮ Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality ⋮ Computing Betweenness Centrality in Link Streams
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Dynamic vulnerability analysis of public transport networks: mitigation effects of real-time information
- The centrality index of a graph
- A faster algorithm for betweenness centrality*
- Bidirectional A* search on time-dependent road networks
- Empirical Analysis of an Evolving Social Network
- Bidirectional A ∗ Search for Time-Dependent Fast Paths
- Time-Dependent SHARC-Routing
- Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks
- Time-Dependent Route Planning
- Entropy of dialogues creates coherent structures in e-mail traffic
This page was built for publication: Scalable computational techniques for centrality metrics on temporally detailed social network