Cores Decomposition of 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 14:4214:42, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,611 bytes +1,611‎ Created page with "Title: Cores Decomposition of Networks Research Question: How can we efficiently determine the cores decomposition of a network? Methodology: The study proposes an efficient algorithm, called the AnO(m)Algorithm for Cores Decomposition of Networks, to determine the cores decomposition of a network. The algorithm is based on the property that a subgraph with a maximum number of vertices of degree k or more is a k-core. The algorithm works by recursively deleting vertice..."
Retrieved from "https://simplesci.org/wiki/Cores_Decomposition_of_Networks"