240 search results - page 4 / 48 » Maximal Contiguous Degrees |
FSTTCS
2001
Springer
13 years 12 months ago
2001
Springer
Consider a directed graph G = (V, E) with n vertices and a root vertex r ∈ V . The DMDST problem for G is one of constructing a spanning tree rooted at r, whose maximal degree is...
CIE
2005
Springer
14 years 27 days ago
2005
Springer
The strong weak truth table reducibility was suggested by Downey, Hirschfeldt, and LaForte as a measure of relative randomness, alternative to the Solovay reducibility. It also occ...
APAL
2007
13 years 7 months ago
2007
We show that there exists a real α such that, for all reals β, if α is linear reducible to β (α ≤ β, previously denoted α ≤sw β) then β ≤T α. In fact, every random ...
JCT
2008
13 years 7 months ago
2008
We study packings of graphs with given maximal degree. We shall prove that the (hitherto unproved) Bollob
COCOON
2005
Springer
14 years 27 days ago
2005
Springer
We study the worst-case performance of the maximal matching heuristic applied to the Minimum Vertex Cover and Minimum Maximal Matching problems, through a careful analysis of tigh...