Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074)
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: Maximum weighted matching with few edge crossings for 2-layered bipartite graph |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum weighted matching with few edge crossings for 2-layered bipartite graph |
scientific article |
Statements
Maximum weighted matching with few edge crossings for 2-layered bipartite graph (English)
0 references
14 October 2020
0 references
edge-weighted bipartite graph
0 references
0 references
0 references
0.797132134437561
0 references
0.7962191104888916
0 references
0.7883414626121521
0 references
0.7868072986602783
0 references
0.7867326736450195
0 references
