An O(m) Algorithm for Cores Decomposition of Networks

Details An O(m) Algorithm for Cores Decomposition of Networks An O(m) Algorithm for Cores Decomposition of Networks

2003-10-25

arxiv.org/abs/cs/0310049v1

Computer Science

Data Structures and Algorithms

Scientific paper

The structure of large networks can be revealed by partitioning them to
smaller parts, which are easier to handle. One of such decompositions is based
on $k$--cores, proposed in 1983 by Seidman. In the paper an efficient, $O(m)$,
$m$ is the number of lines, algorithm for determining the cores decomposition
of a given network is presented.

Affiliated with

Also associated with

No associations

Rating

An O(m) Algorithm for Cores Decomposition of Networks does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with An O(m) Algorithm for Cores Decomposition of Networks, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and An O(m) Algorithm for Cores Decomposition of Networks will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-716519