Generalized Cores
Data Structures and Algorithms
2013-01-22 v1 Discrete Mathematics
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 time.
Keywords
Cite
@article{arxiv.cs/0202039,
title = {Generalized Cores},
author = {V. Batagelj and M. Zaveršnik},
journal= {arXiv preprint arXiv:cs/0202039},
year = {2013}
}