A branch and bound algorithm for minimizing the number of crossing arcs in bipartite graphs (Q1266546): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00356-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2080431890 / rank | |||
Normal rank | |||
Revision as of 00:03, 20 March 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
