Computing maximum non-crossing matching in convex bipartite graphs (Q2897986)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6057326
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing maximum non-crossing matching in convex bipartite graphs |
scientific article; zbMATH DE number 6057326 |
Statements
Computing Maximum Non-crossing Matching in Convex Bipartite Graphs (English)
0 references
16 July 2012
0 references
0.9978014230728148
0 references
0.8530274629592896
0 references
0.8429622054100037
0 references
0.8421122431755066
0 references
