New bounds on the barycenter heuristic for bipartite graph drawing. (Q1853018): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0020-0190(01)00297-6 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2014942297 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 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
0 references
