New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018)
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 1856363
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New bounds on the barycenter heuristic for bipartite graph drawing. |
scientific article; zbMATH DE number 1856363 |
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
0 references
0.8367535471916199
0 references
0.8033329248428345
0 references
0.8033326268196106
0 references
