6 search results - page 2 / 2 » Robust SS watermarking with improved capacity |
CORR
2007
Springer
13 years 10 months ago
2007
Springer
The k-forest problem is a common generalization of both the k-MST and the dense-k-subgraph problems. Formally, given a metric space on n vertices V , with m demand pairs ⊆ V × ...