330 search results - page 13 / 66 » Compressing Bounded Degree Graphs |
141
click to vote
ESA
1994
Springer
15 years 9 months ago
1994
Springer
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a graph having the points of S as its vertices such that for any pair p, q of points ther...
142
Voted
FOCS
2006
IEEE
15 years 11 months ago
2006
IEEE
We consider the minimum cost spanning tree problem under the restriction that all degrees must be at most a given value k. We show that we can efficiently find a spanning tree o...
137
click to vote
STACS
2010
Springer
15 years 12 months ago
2010
Springer
The degree of a CSP instance is the maximum number of times that a variable may appear in the scope of constraints. We consider the approximate counting problem for Boolean CSPs wi...
131
Voted
TCS
2008
15 years 4 months ago
2008
Given a graph G and an integer k, two players alternatively color the edges of G using k colors so that adjacent edges get different colors. The game chromatic index g(G) is the m...
167
click to vote
ICALP
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...