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 batagelj2002generalized
%A Batagelj, Vladimir
%A Zaveršnik, Matjaž
%D 2002
%K core generalized p-core
%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{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 = {2012-09-25T17:39:25.000+0200},
author = {Batagelj, Vladimir and Zaveršnik, Matjaž},
biburl = {https://www.bibsonomy.org/bibtex/27951390a09c2a2f7991bfbaba9877ff5/sdo},
description = {[cs/0202039] Generalized Cores},
interhash = {909808bf89a41bbb2c292ebf66315398},
intrahash = {7951390a09c2a2f7991bfbaba9877ff5},
keywords = {core generalized p-core},
note = {cite arxiv:cs/0202039},
timestamp = {2014-01-17T14:58:02.000+0100},
title = {Generalized Cores},
url = {http://arxiv.org/abs/cs/0202039},
year = 2002
}