646 citations · 1.2k across the 19 of their papers we have counts for
Showing 2003Show all
3 papers · 1 filter
cs.DS2003★ 646 cited
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.DL2003★ 219 cited
Efficient Algorithms for Citation Network Analysis
Vladimir Batagelj
In the paper very efficient, linear in number of arcs, algorithms for determining Hummon and Doreian's arc weights SPLC and SPNP in citation network are proposed, and some theoreti…
cs.DS2003★ 10 cited
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…