26 search results - page 4 / 6 » Vertex and Hyperedge Connectivity in Dynamic Graph Streams |
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
NETWORKING
2007
14 years 11 months ago
2007
This paper addresses the study of fundamental properties of stream-based content distribution services. We assume the presence of an overlay network with limited connectivity degre...
ICALP
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We study the “subgraph connectivity” problem for undirected graphs with sublinear vertex update time. In this problem, we can make vertices active or inactive in a gr...
SIROCCO
2000
14 years 10 months ago
2000
: We consider a well known distributed coloring game played on a simple connected graph: initially, each vertex is colored black or white; at each round, each vertex simultaneously...
SMI
2008
IEEE
15 years 3 months ago
2008
IEEE
We present a fast deformation-based method for building time-varying surface models of dynamic objects from multiview video streams. Starting from an initial mesh representation, ...