A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546)
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 1208480
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs |
scientific article; zbMATH DE number 1208480 |
Statements
A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (English)
0 references
7 October 1998
0 references
crossing arcs minimization
0 references
automatic graph drawing
0 references
bipartite graphs
0 references
acyclic directed graphs
0 references
branch-and-bound
0 references
0.894623875617981
0 references
0.8308333158493042
0 references
0.8290476202964783
0 references
0.7744830846786499
0 references
