156 search results - page 21 / 32 » Edge ranking of weighted trees |
146
click to vote
DAM
2008
15 years 6 months ago
2008
Given an edge- or vertex-weighted graph or digraph and a list of source-sink pairs, the minimum multicut problem consists in selecting a minimum weight set of edges or vertices wh...
162
click to vote
ESA
2004
Springer
15 years 11 months ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...
154
click to vote
ADMA
2005
Springer
15 years 11 months ago
2005
Springer
Accurate probability-based ranking of instances is crucial in many real-world data mining applications. KNN (k-nearest neighbor) [1] has been intensively studied as an effective c...
147
click to vote
STOC
2005
ACM
16 years 6 months ago
2005
ACM
We show that every weighted connected graph G contains as a subgraph a spanning tree into which the edges of G can be embedded with average stretch O log2 n log log n . Moreover, w...
157
click to vote
PODC
2005
ACM
15 years 11 months ago
2005
ACM
The problem of verifying a Minimum Spanning Tree (MST) was introduced by Tarjan in a sequential setting. Given a graph and a tree that spans it, the algorithm is required to check...