725 search results - page 8 / 145 » Bounding Degrees on RPL |
DM
2010
14 years 9 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
JCT
2008
14 years 9 months ago
2008
We study a discrete optimization problem introduced by Babai, Frankl, Kutin, and Stefankovic (2001), which provides bounds on degrees of polynomials with p-adically controlled beh...
ESA
1994
Springer
15 years 1 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...
MFCS
1995
Springer
15 years 1 months ago
1995
Springer
The graph inference from a walk for a class C of undirected edge-colored graphs is, given a string x of colors, nding the smallest graph G in C that allows a traverse of all edge...
CIE
2005
Springer
15 years 3 months ago
2005
Springer
The d-c.e. (difference of c.e.) and dbc (divergence bounded computable) reals are two important subclasses of ∆0 2-reals which have very interesting computability-theoretical as...