Minimizing crossings in constrained two-sided circular graph layouts (Q5207872)
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: Minimizing crossings in constrained two-sided circular graph layouts |
scientific article; zbMATH DE number 7150580
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Minimizing crossings in constrained two-sided circular graph layouts |
scientific article; zbMATH DE number 7150580 |
Statements
13 January 2020
0 references
Minimizing crossings in constrained two-sided circular graph layouts. (English)
0 references
0.8029237389564514
0 references
0.7903599143028259
0 references
0.7850058078765869
0 references
0.782556414604187
0 references
