Generalized Cores

V. Batagelj, and M. Zaversnik. (2002)cs.DS/0202039.


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, łog n))$ time.

Links and resources

BibTeX key:
internal link:
You can use this internal link to create references to this post in your discussions. Just copy this internal link and paste it in your discussion text.
search on:

Comments and Reviews  

@folke has written a comment or review.  Join the discussion!


Cite this publication