3 papers
cs.DS2003
An O(m) Algorithm for Cores Decomposition of Networks
V. Batagelj, M. Zaversnik
The structure of large networks can be revealed by partitioning them to smaller parts, which are easier to handle. One of such decompositions is based on --cores, proposed in 19…
cs.DS2003
Short Cycles Connectivity
V. Batagelj, M. Zaversnik
Short cycles connectivity is a generalization of ordinary connectivity. Instead by a path (sequence of edges), two vertices have to be connected by a sequence of short cycles, in w…
cs.DS2002
Generalized Cores
V. Batagelj, M. Zaveršnik
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…