Efficient Search Algorithms in Power-Law Networks: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 02:1102:11, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,497 bytes +1,497‎ Created page with "Title: Efficient Search Algorithms in Power-Law Networks Main Research Question: How can we develop efficient search algorithms for networks with power-law degree distributions, such as peer-to-peer networks? Methodology: We propose a number of local search strategies that utilize high-degree nodes in power-law graphs. These strategies have sub-linear costs that scale with the size of the graph. We demonstrate the utility of these strategies on the Gnutella peer-to-pee..."
Retrieved from "https://simplesci.org/wiki/Efficient_Search_Algorithms_in_Power-Law_Networks"