New bounds on the barycenter heuristic for bipartite graph drawing.
type: Item
instance of: scholarly article
title: New bounds on the barycenter heuristic for bipartite graph drawing.
zbMATH Open document ID: 1051.68115
DOI: 10.1016/S0020-0190(01)00297-6
author: XiaoYu Li
author: Matthias F. M. Stallmann
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1856363
zbMATH Keywords: Barycenter heuristic
zbMATH Keywords: Performance ratio
zbMATH Keywords: Graph drawing
MaRDI profile type: Publication
cites work: Q3154375
cites work: Drawing graphs in two layers
cites work: Edge crossings in drawings of bipartite graphs
cites work: Crossing Number is NP-Complete
cites work: Trees with Hamiltonian square
cites work: Q5677508
cites work: 2-Layer Straightline Crossing Minimization: Performance of Exact and Heuristic Algorithms
cites work: Experiments on drawing 2-level hierarchical graphs
cites work: Q4505705
full work available at URL: s0020-0190(01)00297-6
OpenAlex ID: W2014942297
description: scientific article; zbMATH DE number 1856363