Computing maximum non-crossing matching in convex bipartite graphs (Q2348053)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing maximum non-crossing matching in convex bipartite graphs |
scientific article |
Statements
Computing maximum non-crossing matching in convex bipartite graphs (English)
0 references
10 June 2015
0 references
maximum non-crossing matching
0 references
maximum matching
0 references
convex bipartite graphs
0 references
algorithms
0 references
data structures
0 references
0 references
