398 search results - page 35 / 80 » Ant Algorithm for the Graph Matching Problem |
ALGORITHMICA
2010
13 years 7 months ago
2010
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
ICDCS
2009
IEEE
14 years 4 months ago
2009
IEEE
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
ICWS
2008
IEEE
13 years 9 months ago
2008
IEEE
In this paper, we have studied a common Web service composition problem, the syntactic matching problem, where the output parameters of a Web service can be used as the input para...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
In this paper we rigorously prove the validity of the cavity method for the problem of counting the number of matchings in graphs with large girth. Cavity method is an important he...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...