Stefanes MA, Rubert D, Soares J. Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs. Theoretical Computer Science. 2020;804:58-71
Matching is a set of edges in a graph which each of the edge does not share a common vertex. Maximum...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
AbstractThe problem of determining the maximum matching in a convex bipartite graph, G = (V1, V2, E)...
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartit...
We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on d...
Parallel graph algorithm design is a very well studied topic. Many results have been presented for t...
AbstractThe intensive study of fast parallel and distributed algorithms for various routing (and com...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Abstract—We design and implement distributed-memory par-allel algorithms for computing maximal cardi...
Parallel algorithms are given for finding a maximum weighted clique, a maximum weighted independent ...
AbstractParallel algorithms are given for finding a maximum weighted clique, a maximum weighted inde...
We consider the problem of computing a weighted edge matching in a large graph using a parallel algo...
We present experimental results for 3 bipartite matching algorithms on three classes of sparse graph...
We design and implement an efficient parallel algorithm for finding a perfect matching in a weighted...
Abstract: The paper surveys the techniques used for designing the most efficient algorithms for find...
Matching is a set of edges in a graph which each of the edge does not share a common vertex. Maximum...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
AbstractThe problem of determining the maximum matching in a convex bipartite graph, G = (V1, V2, E)...
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartit...
We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on d...
Parallel graph algorithm design is a very well studied topic. Many results have been presented for t...
AbstractThe intensive study of fast parallel and distributed algorithms for various routing (and com...
Coordinated Science Laboratory was formerly known as Control Systems LaboratoryJoint Services Electr...
Abstract—We design and implement distributed-memory par-allel algorithms for computing maximal cardi...
Parallel algorithms are given for finding a maximum weighted clique, a maximum weighted independent ...
AbstractParallel algorithms are given for finding a maximum weighted clique, a maximum weighted inde...
We consider the problem of computing a weighted edge matching in a large graph using a parallel algo...
We present experimental results for 3 bipartite matching algorithms on three classes of sparse graph...
We design and implement an efficient parallel algorithm for finding a perfect matching in a weighted...
Abstract: The paper surveys the techniques used for designing the most efficient algorithms for find...
Matching is a set of edges in a graph which each of the edge does not share a common vertex. Maximum...
Abstract. ± We consider the problem of computing a matching in a large weighted graph using a parall...
AbstractThe problem of determining the maximum matching in a convex bipartite graph, G = (V1, V2, E)...
DOI
Add to ORKG