Child pages
  • Extract K-Core (Unweighted & Directed)

Versions Compared

Key

  • This line was added.
  • This line was removed.
  • Formatting was changed.
Comment: Migrated to Confluence 5.3

...

Extract the k'th k-core from a graph as a separate graph. The k-th k-core is what remains of the graph after every node with fewer than k edges connected to it is removed from the graph recursively.

Parameters

k – the k-core to extract

Applications

...

  • Source Code: ...
  • Home Page: ...
References
  • Wiki MarkupB. Bollobas, The evolution of sparse graphs, in Graph Theory and Combinatorics, Proc. Cambridge Combinatorial Conf. in honor of Paul Erdos, Academic Press, 1984, 35-57. (References: \ [ALGDOC:1\], \ [ALGDOC:2\])
  • S. B. Seidman, Network structure and minimum degree, Social Networks 5:269-287.
  • Size and Connectivity of the k-core of a Random Graph. ?uczak, Tomasz.
  • Generalized Cores. V. Batagelj, M. Zaversnik.
  • k-Core Organization of Complex Networks. Dorogovtsev, Goltsev, Mendes

...

See Also

...

Incoming Links
spaces