| J |
Batagelj, V. & Zaversnik, M.
(2002):
Generalized Cores.
In: CoRR,
Vol. cs.DS/0202039,
Erscheinungsjahr/Year: 2002.
[Volltext] [BibTeX]
[Endnote]
@article{journals/corr/cs-DS-0202039,
author = {Batagelj, Vladimir and Zaversnik, Matjaz},
title = {Generalized Cores},
journal = {CoRR},
year = {2002},
volume = {cs.DS/0202039},
url = {http://dblp.uni-trier.de/db/journals/corr/corr0202.html#cs-DS-0202039},
keywords = {core, p-core, generalized}
}
%0 = article
%A = Batagelj, Vladimir and Zaversnik, Matjaz
%D = 2002
%T = Generalized Cores
%U = http://dblp.uni-trier.de/db/journals/corr/corr0202.html#cs-DS-0202039
|
|
Batagelj, V. & Zaveršnik, M.
(2002):
Generalized Cores.
[Volltext] [Kurzfassung] [BibTeX] [Endnote] Cores are, besides connectivity components, one among few concepts that ovides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based on rtex property function is presented. It is shown that for the local monotone rtex property functions the corresponding cores can be determined in $O(m ax ( logn))$ time.
@misc{batagelj2002generalized,
author = {Batagelj, Vladimir and Zaveršnik, Matjaž},
title = {Generalized Cores},
year = {2002},
note = {cite arxiv:cs/0202039},
url = {http://arxiv.org/abs/cs/0202039},
keywords = {core, p-core, generalized},
abstract = {Cores are, besides connectivity components, one among few concepts thatprovides us with efficient decompositions of large graphs and networks. In the paper a generalization of the notion of core of a graph based onvertex property function is presented. It is shown that for the local monotonevertex property functions the corresponding cores can be determined in $O(mmax( logn))$ time.}
}
%0 = misc
%A = Batagelj, Vladimir and Zaveršnik, Matjaž
%B = }
%C =
%D = 2002
%I =
%T = Generalized Cores}
%U = http://arxiv.org/abs/cs/0202039
|