3708 search results - page 127 / 742 » Approximating Betweenness Centrality |
168
Voted
SSD
2009
Springer
15 years 7 months ago
2009
Springer
The range nearest-neighbor (NN) query is an important query type in location-based services, as it can be applied to the case that an NN query has a spatial region, instead of a lo...
112
Voted
CPM
2000
Springer
15 years 5 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
114
click to vote
CPM
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In the context of non-coding RNA (ncRNA) multiple structural alignment, Davydov and Batzoglou introduced in [7] the problem of finding the largest nested linear graph tha...
119
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
115
Voted
SODA
1998
ACM
15 years 2 months ago
1998
ACM
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...