@misc{batagelj-2002,
title = {Generalized Cores},
author = {V. Batagelj and M. Zaversnik},
note = {cs.DS/0202039},
url = {http://arxiv.org/ps/cs/0202039},
year = {2002},
abstract = {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.},
keywords = {core generalized graph kern p reduction subgraph }
}