Random walk search in unstructured P2P
From MaRDI portal
Recommendations
Cited in
(9)- Improved degree search algorithms in unstructured P2P networks
- Scalable percolation search on complex networks
- JumpNet: improving connectivity and robustness in unstructured P2P networks by randomness
- scientific article; zbMATH DE number 5072496 (Why is no real title available?)
- Divisional searching strategy based on degree in unstructured P2P networks
- A model of self-avoiding random walks for searching complex networks
- Numerical evaluation of the random walk search algorithm
- Optimizing random walk search algorithms in P2P networks
- Performance of random walks in one-hop replication networks
This page was built for publication: Random walk search in unstructured P2P
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2936304)