8917 search results - page 219 / 1784 » Abstraction in Algorithm Animation |
129
click to vote
PPAM
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the problem of computing a weighted edge matching in a large graph using a parallel algorithm. This problem has application in several areas of combinatorial ...
146
click to vote
SLS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
117
click to vote
ASIACRYPT
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...
112
click to vote
EUC
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We have presented an optimal algorithm for minimal cost loop problem (MCLP), which consists of finding a set of minimum cost loops rooted at a source node. In the MCLP, t...
116
click to vote
WEA
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...