241 search results - page 39 / 49 » Degree Bounded Spanning Trees |
GD
2009
Springer
13 years 12 months ago
2009
Springer
A graph G is a support for a hypergraph H = (V, S) if the vertices of G correspond to the vertices of H such that for each hyperedge Si ∈ S the subgraph of G induced by Si is co...
GC
2008
Springer
13 years 7 months ago
2008
Springer
In this paper we study the class of weakly quasi-threshold graphs that are obtained from a vertex by recursively applying the operations (i) adding a new isolated vertex, (ii) addi...
ICALP
2009
Springer
14 years 7 months ago
2009
Springer
The algebraic framework introduced in [Koutis, Proc. of the 35th ICALP 2008] reduces several combinatorial problems in parameterized complexity to the problem of detecting multili...
FOCS
2007
IEEE
14 years 1 months ago
2007
IEEE
In this paper, we resolve the smoothed and approximative complexity of low-rank quasi-concave minimization, providing both upper and lower bounds. As an upper bound, we provide th...
ICALP
2007
Springer
14 years 1 months ago
2007
Springer
Gaifman’s locality theorem states that every first-order sentence is equivalent to a local sentence. We show that there is no elementary bound on the length of the local sentenc...