15485 search results - page 420 / 3097 » Computing Optimal Subsets |
179
click to vote
STACS
2010
Springer
16 years 1 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
IPPS
2007
IEEE
16 years 1 months ago
2007
IEEE
172
click to vote
WG
2005
Springer
16 years 9 days ago
2005
Springer
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that vertices can be assigned various domination powers. Broa...
155
click to vote
SPAA
2003
ACM
16 years 2 days ago
2003
ACM
This paper proves that for every positive integers n and k, we can explicitly construct a graph G with n+O(k) vertices and maximum degree 3, such that even after removing any k ve...
110
click to vote
RTA
2010
Springer
15 years 10 months ago
2010
Springer
We describe performance enhancements that have been added to mkbTT, a modern completion tool combining multi-completion with the use of termination tools.