2503 search results - page 240 / 501 » A study of 3-arc graphs |
166
click to vote
COMGEO
2008
ACM
15 years 6 months ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
168
click to vote
CPC
2007
15 years 6 months ago
2007
We study a dynamically evolving random graph which adds vertices and edges using preferential attachment and is “attacked by an adversary”. At time t, we add a new vertex xt a...
170
click to vote
RSA
2006
15 years 6 months ago
2006
Motivated by a problem that arises in the study of mirrored storage systems, we describe, for any fixed , > 0 and any integer d 2, explicit or randomized constructions of d-r...
191
click to vote
IM
2007
15 years 6 months ago
2007
Abstract. The web may be viewed as a graph each of whose vertices corresponds to a static HTML web page, and each of whose edges corresponds to a hyperlink from one web page to ano...
211
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
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...