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 Journal Article
%1 batagelj2002generalized
%A Batagelj, V.
%A Zaversnik, M.
%D 2002
%J CoRR
%K analysis core generalized graph kcore network
%T Generalized Cores
%U http://arxiv.org/abs/cs/0202039
%V cs.DS/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.
@article{batagelj2002generalized,
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 = {2007-04-30T17:36:42.000+0200},
author = {Batagelj, V. and Zaversnik, M.},
biburl = {https://www.bibsonomy.org/bibtex/29a2144b87c422fae12b4cf1fe2613399/jaeschke},
interhash = {775d7337332536953aaac48aedae1a68},
intrahash = {9a2144b87c422fae12b4cf1fe2613399},
journal = {CoRR},
keywords = {analysis core generalized graph kcore network},
timestamp = {2014-07-28T15:57:31.000+0200},
title = {Generalized Cores},
url = {http://arxiv.org/abs/cs/0202039},
volume = {cs.DS/0202039},
year = 2002
}