Shortest path tree sampling for landmark selection in large networks

DOI10.1093/COMNET/CNX008MaRDI QIDQ4985070zbMATH OpenOpenAlexFDO

Authors Shlomi Maliah, Rami Puzis, Guy Shani

Publication date 22 April 2021

Published in Journal of Complex Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1093/comnet/cnx008

zbMATH Keywords

distance estimationlandmarkslarge networksshortest path

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Communication networks in operations research (90B18)

Recommendations

• Sampling networks by the union of \(m\) shortest path trees
• Degree distribution of shortest path trees and bias of network sampling algorithms
• Sampling social networks using shortest paths
• scientific article; zbMATH DE number 1528594
• Guided sampling for large graphs
• Fast approximation of betweenness centrality through sampling
• Shortest‐path metric approximation for random subgraphs
• An Efficient Sampling Algorithm for Network Motif Detection

This page was built for publication: Shortest path tree sampling for landmark selection in large networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4985070)