6 search results - page 1 / 2 » Partitioning a Weighted Graph to Connected Subgraphs of Almo... |
WG
2004
Springer
13 years 10 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
COCOON
2006
Springer
13 years 7 months ago
2006
Springer
Assume that each vertex of a graph G is assigned a constant number q of nonnegative integer weights, and that q pairs of nonnegative integers li and ui, 1 i q, are given. One wis...
JDA
2006
13 years 5 months ago
2006
Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wishes to partition G into connected components by del...
CORR
2011
Springer
12 years 8 months ago
2011
Springer
Many online networks are measured and studied via sampling techniques, which typically collect a relatively small fraction of nodes and their associated edges. Past work in this a...
APPROX
2010
Springer
13 years 6 months ago
2010
Springer
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...