352 search results - page 11 / 71 » Partitioning Graphs into Connected Parts |
163
click to vote
FOCS
2007
IEEE
16 years 17 hour ago
2007
IEEE
We present a near-optimal reduction from approximately counting the cardinality of a discrete set to approximately sampling elements of the set. An important application of our wo...
135
click to vote
ARSCOM
2008
15 years 5 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
157
click to vote
APPROX
2010
Springer
15 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...
132
Voted
COMBINATORICA
2006
15 years 5 months ago
2006
Given a universal binary countable homogeneous structure U and n , there is a partition of the induced n-element substructures of U into finitely many classes so that for any par...
158
click to vote
JDA
2008
15 years 5 months ago
2008
Suppose that each vertex of a graph G is either a supply vertex or a demand vertex and is assigned a positive real number, called the supply or the demand. Each demand vertex can ...