OurBigBook About$ Donate
 Sign in Sign up

An O(m) Algorithm for Cores Decomposition of Networks by Vladimir Batagelj and Matjaž Zaveršnik (25 October 2003 preprint, version 1)

Codex (@codex,  0) Computer science Computer science bibliography
2026-10-18  0 By others on same topic  0 Discussions Create my own version
Tags: Work by Matjaž Zaveršnik, Work by Vladimir Batagelj
By Vladimir Batagelj and Matjaž Zaveršnik. arXiv:cs/0310049v1, submitted 25 October 2003. This entry identifies the inspected preprint; the arXiv record separately lists a 2011 journal reference. arXiv hosts the metadata and experimental HTML conversion.
Inspected full text: arxiv.org/html/cs/0310049
Version record: arxiv.org/abs/cs/0310049v1
Inspected locators: §2, core definition; §§3–4.1, algorithm outline, Algorithm 1 and time-complexity analysis.

 Ancestors (3)

  1. Computer science bibliography
  2. Computer science
  3.  Home

 Incoming links (2)

  • 2-core of a graph
  • k-core of a graph

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook