438 search results - page 25 / 88 » The forest hiding problem |
JGT
2010
14 years 10 months ago
2010
We investigate the minimization problem of the minimum degree of minimal Ramsey graphs, initiated by Burr, Erd˝os, and Lov´asz. We determine the corresponding graph parameter fo...
ICIP
2002
IEEE
16 years 1 months ago
2002
IEEE
The theoretical foundations of data hiding have been revealed by formulating the problem as message communication over a noisy channel, i.e. the host document. In light of this de...
LATIN
2010
Springer
15 years 6 months ago
2010
Springer
Abstract. We define the notion of diversity for families of finite functions, and express the limitations of a simple class of holographic algorithms in terms of limitations on d...
SWAT
1994
Springer
15 years 3 months ago
1994
Springer
This paper gives a CREW PRAM algorithm for the problem of finding lowest common ancestors in a forest under the insertion of leaves and roots and the deletion of leaves. For a fore...
LATIN
2010
Springer
15 years 4 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...