A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (Q411236)
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: A rearrangement of adjacency matrix based approach for solving the crossing minimization problem |
scientific article; zbMATH DE number 6021868
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A rearrangement of adjacency matrix based approach for solving the crossing minimization problem |
scientific article; zbMATH DE number 6021868 |
Statements
A rearrangement of adjacency matrix based approach for solving the crossing minimization problem (English)
0 references
4 April 2012
0 references
crossing minimization
0 references
adjacency matrix
0 references
network flow
0 references
TSP
0 references
0 references
0.7924591302871704
0 references
0.7888575196266174
0 references
0.7877545356750488
0 references
0.7877545356750488
0 references
