Optimal uniform shortest path sampling

DOI10.1007/978-981-96-2845-2_11MaRDI QIDQ6996797zbMATH OpenFDO

Authors Simon Dreyer, Antoine Genitrini, Mehdi Naima

Publication date 15 April 2025

Full work available at URL https://doi.org/10.1007/978-981-96-2845-2_11

zbMATH Keywords

alias samplinggraph algorithmrandom generationshortest pathsuniform sampling

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A calculus for the random generation of labelled combinatorial structures
• A faster algorithm for betweenness centrality*
• A quantitative study of fork-join processes with non-deterministic choice: application to the statistical exploration of the state-space
• Bias Reduction in Traceroute Sampling – Towards a More Accurate Map of the Internet
• Describing and simulating internet routes
• Exploring networks with traceroute-like probes: Theory and simulations
• scientific article; zbMATH DE number 3535592 (Why is no real title available?)
• scientific article; zbMATH DE number 1265079 (Why is no real title available?)
• On the bias of traceroute sampling
• Sampling networks by the union of \(m\) shortest path trees
• Sampling social networks using shortest paths
• Shortest-path queries in static networks

This page was built for publication: Optimal uniform shortest path sampling

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