New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 11:10, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | New bounds on the barycenter heuristic for bipartite graph drawing. |
scientific article |
Statements
New bounds on the barycenter heuristic for bipartite graph drawing. (English)
0 references
21 January 2003
0 references
Barycenter heuristic
0 references
Performance ratio
0 references
Graph drawing
0 references
