1027 search results - page 82 / 206 » Ordered Vertex Partitioning |
131
click to vote
JAL
2002
15 years 5 months ago
2002
The element connectivity problem falls in the category of survivable network design problems { it is intermediate to the versions that ask for edge-disjoint and vertex-disjoint pa...
196
click to vote
COMBINATORICA
2011
14 years 5 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
168
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
142
click to vote
WAOA
2005
Springer
15 years 11 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
170
click to vote
FSTTCS
2009
Springer
15 years 10 months ago
2009
Springer
We introduce a graph clustering problem motivated by a stream processing application. Input to our problem is an undirected graph with vertex and edge weights. A cluster is a subse...