Computer Science – Data Structures and Algorithms
Scientific paper
2002-02-28
Computer Science
Data Structures and Algorithms
Scientific paper
Cores are, besides connectivity components, one among few concepts that provides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based on vertex property function is presented. It is shown that for the local monotone vertex property functions the corresponding cores can be determined in $O(m \max (\Delta, \log n))$ time.
Batagelj Vladimir
Zaveršnik M.
No associations
LandOfFree
Generalized Cores 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 Generalized Cores, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Generalized Cores will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-328528