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 this page instead for the normal view: Computing Maximum Non-crossing Matching in Convex Bipartite Graphs |
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
16 July 2012
0 references
