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
(\Delta, n))$ time.
%0 Generic
%1 Batagelj2002
%A Batagelj, V.
%A Zaveršnik, M.
%D 2002
%K k-cores networks
%T Generalized Cores
%U http://arxiv.org/abs/cs/0202039
%X 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
(\Delta, n))$ time.
@misc{Batagelj2002,
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.
},
added-at = {2009-02-20T17:33:48.000+0100},
author = {Batagelj, V. and Zaveršnik, M.},
biburl = {https://www.bibsonomy.org/bibtex/2806aea3edbbfd8b26263ec3988e17a18/kurtjx},
interhash = {ca502d5ce1963952be6d810cbe712fc6},
intrahash = {806aea3edbbfd8b26263ec3988e17a18},
keywords = {k-cores networks},
note = {cite arxiv:cs.DS/0202039
},
timestamp = {2009-02-20T17:34:09.000+0100},
title = {Generalized Cores},
url = {http://arxiv.org/abs/cs/0202039},
year = 2002
}