An alternative method to crossing minimization on hierarchical graphs (Q2719241)
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: An alternative method to crossing minimization on hierarchical graphs |
scientific article; zbMATH DE number 1608902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An alternative method to crossing minimization on hierarchical graphs |
scientific article; zbMATH DE number 1608902 |
Statements
21 June 2001
0 references
2-level graphs
0 references
2-level planarization
0 references
graph drawing
0 references
integer linear programming
0 references
polyhedral combinatorics
0 references
branch-and-cut
0 references
An alternative method to crossing minimization on hierarchical graphs (English)
0 references
