725 search results - page 12 / 145 » Bounding Degrees on RPL |
108
Voted
SWAT
1994
Springer
15 years 4 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
111
Voted
ALGORITHMICA
2004
15 years 17 days ago
2004
We consider the Chromatic Sum Problem on bipartite graphs which appears to be much harder than the classical Chromatic Number Problem. We prove that the Chromatic Sum Problem is NP...
105
Voted
COMBINATORICA
2007
15 years 21 days ago
2007
We derive a sufficient condition for a sparse graph G on n vertices to contain a copy of a tree T of maximum degree at most d on (1 − )n vertices, in terms of the expansion prop...
105
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
We study ways to expedite Yates's algorithm for computing the zeta and Moebius transforms of a function defined on the subset lattice. We develop a trimmed variant of Moebius ...
94
Voted
FOCS
2010
IEEE
14 years 10 months ago
2010
IEEE
For an n-variate degree