649 search results - page 86 / 130 » A Graph Pebbling Algorithm on Weighted Graphs |
ICCI
1991
14 years 12 days ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
STOC
2005
ACM
14 years 9 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
DCOSS
2009
Springer
14 years 1 months ago
2009
Springer
Abstract. In this paper we present local distributed algorithms for constructing spanners in wireless sensor networks modeled as unit ball graphs (shortly UBGs) and quasi-unit ball...
IPL
1998
13 years 8 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
APPROX
2005
Springer
14 years 2 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...