Optimal partition of a bipartite graph into non-crossing matchings (Q3438979): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s1571-0653(04)00390-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005255058 / rank | |||
Normal rank | |||
Latest revision as of 08:57, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Optimal partition of a bipartite graph into non-crossing matchings |
scientific article |
Statements
Optimal partition of a bipartite graph into non-crossing matchings (English)
0 references
29 May 2007
0 references
