8 search results - page 2 / 2 » Partitioning a graph of bounded tree-width to connected subg... |
APPROX
2010
Springer
13 years 7 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...
ISAAC
2005
Springer
13 years 11 months ago
2005
Springer
A partition of a set of n items is a grouping of the items into k disjoint classes of equal size. Any partition can be modeled as a graph: the items become the vertices of the grap...
CORR
2011
Springer
12 years 9 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...