Scaling up the sparse matrix-vector multiplication kernel on modern Graphics Processing Units (GPU) has been at the heart of numerous studies in both academia and industry. In thi...
We give two efficient on-line algorithms to simplify weighted graphs by eliminating degree-two vertices. Our algorithms are on-line -- they react to updates on the data, keeping t...
Floris Geerts, Peter Z. Revesz, Jan Van den Bussch...
I consider the setting of transductive learning of vertex labels in graphs, in which a graph with n vertices is sampled according to some unknown distribution; there is a true lab...
This paper identifies and explores the problem of seed selection in a web-scale crawler. We argue that seed selection is not a trivial but very important problem. Selecting proper...
In social network theory, a simple graph G is called k-role assignable if there is a surjective mapping that assigns a number from {1, . . . , k} called a role to each vertex of G ...