Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (Q2283031)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs |
scientific article |
Statements
Scalable parallel algorithms for maximum matching and Hamiltonian circuit in convex bipartite graphs (English)
0 references
27 December 2019
0 references
convex bipartite graphs
0 references
graph matching
0 references
linear-time Hamiltonian circuit
0 references
coarse grained parallel computing
0 references
0 references
