Discovering the hidden community structure of public transportation networks
From MaRDI portal
Publication:6195402
DOI10.1007/s11067-019-09476-3arXiv1801.03857WikidataQ127333955 ScholiaQ127333955MaRDI QIDQ6195402
László Hajdu, András Bóta, Alireza Khani, Miklós Krész, Lauren M. Gardner
Publication date: 13 March 2024
Published in: Networks and Spatial Economics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.03857
Related Items (1)
Cites Work
- Trip-based path algorithms using the transit network hierarchy
- The role of spatial interaction in social networks
- Pedestrian travel behavior modeling
- Dynamic user equilibrium model for combined activity-travel choices using activity-travel supernetwork representation
- Identifying critical components of a public transit system for outbreak control
- Finding outbreak trees in networks with limited information
- Spectral redemption in clustering sparse networks
- Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
- Limits of Predictability in Human Mobility
- Learning latent block structure in weighted networks
- Fast unfolding of communities in large networks
- Overlapping community detection in networks
- Algorithm 457: finding all cliques of an undirected graph
This page was built for publication: Discovering the hidden community structure of public transportation networks
