Sciweavers

3204 search results - page 211 / 641
» The b-chromatic Number of a Graph
Sort
View
CORR
2011
Springer
199views Education» more  CORR 2011»
13 years 5 months ago
Fast Sparse Matrix-Vector Multiplication on GPUs: Implications for Graph Mining
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...
Xintian Yang, Srinivasan Parthasarathy, Ponnuswamy...
GIS
2006
ACM
14 years 11 months ago
On-line maintenance of simplified weighted graphs for efficient distance queries
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...
ICML
2006
IEEE
14 years 11 months ago
An analysis of graph cut size for transductive learning
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...
Steve Hanneke
WWW
2009
ACM
14 years 11 months ago
Graph based crawler seed selection
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...
Shuyi Zheng, Pavel Dmitriev, C. Lee Giles
FCT
2009
Springer
14 years 5 months ago
Computing Role Assignments of Chordal Graphs
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 ...
Pim van 't Hof, Daniël Paulusma, Johan M. M. ...