A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:38, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs |
scientific article |
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
