1891 search results - page 379 / 379 » Very Large Databases: How Large, How Different |
114
click to vote
CORR
2007
Springer
15 years 3 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 × ...