A tabu search algorithm for the bipartite drawing problem (Q1609918)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1782825
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A tabu search algorithm for the bipartite drawing problem |
scientific article; zbMATH DE number 1782825 |
Statements
A tabu search algorithm for the bipartite drawing problem (English)
0 references
18 August 2002
0 references
graph drawing problem
0 references
arc crossing minimization
0 references
tabu search
0 references
0 references
0.9591371
0 references
0 references
0 references
0.8673788
0 references
0 references
0.86656713
0 references
0.8651236
0 references
