725 search results - page 27 / 145 » Bounding Degrees on RPL |
153
click to vote
CCA
2009
Springer
16 years 18 days ago
2009
Springer
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
186
click to vote
JSYML
2008
15 years 6 months ago
2008
We say that A LR B if every B-random number is A-random. Intuitively this means that if oracle A can identify some patterns on some real , oracle B can also find patterns on . In o...
160
click to vote
APPROX
2008
Springer
15 years 7 months ago
2008
Springer
Given a graph H = (V, F) with edge weights {w(e) : e F}, the weighted degree of a node v in H is {w(vu) : vu F}. We give bicriteria approximation algorithms for problems that see...
143
click to vote
JCT
2008
15 years 6 months ago
2008
The old well-known result of Chartrand, Kaugars and Lick [1] says that every k-connected graph G with minimum degree at least 3k/2 has a vertex v such that G - v is still k-connec...
161
click to vote
DM
2008
15 years 6 months ago
2008
We prove that a K4-free graph G of order n, size m and maximum degree at most three has an independent set of cardinality at least 1 7 (4n - m - - tr) where counts the number of c...