1951 search results - page 81 / 391 » An algorithm for improving graph partitions |
146
click to vote
ALGORITHMICA
2002
15 years 4 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...
121
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
125
click to vote
CIKM
2004
Springer
15 years 9 months ago
2004
Springer
Recently published studies have shown that partitional clustering algorithms that optimize certain criterion functions, which measure key aspects of inter- and intra-cluster simil...
122
click to vote
SODA
1997
ACM
15 years 5 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
129
click to vote
ESOP
2000
Springer
15 years 7 months ago
2000
Springer
In order to deal efficiently with infinite regular trees (or other pointed graph structures), we give new algorithms to store such structures. The trees are stored in such a way th...