A better heuristic for orthogonal graph drawings
type: Item
instance of: scholarly article
title: A better heuristic for orthogonal graph drawings
zbMATH Open document ID: 0894.68104
DOI: 10.1016/S0925-7721(97)00026-6
author: Goos Kant
author: Therese Biedl
published in: Computational Geometry
publication date: 1998-08-19T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1140209
zbMATH Keywords: orthogonal graph drawings
Wikidata QID: Q56689781
MaRDI profile type: Publication
cites work: Optimal orthogonal drawings of triconnected plane graphs
cites work: A linear algorithm for embedding planar graphs using PQ-trees
cites work: Algorithms for drawing graphs: An annotated bibliography
cites work: An experimental comparison of four graph drawing algorithms.
cites work: Computing an st-numbering
cites work: Q4028111
cites work: Drawing planar graphs using the canonical ordering
cites work: Q5596083
cites work: Q3997942
cites work: General theoretical results on rectilinear embeddability of graphs
cites work: Drawing graphs on rectangular grids
cites work: On minimal-node-cost planar embeddings
cites work: On Embedding a Graph in the Grid with the Minimum Number of Bends
cites work: Lower bounds for planar orthogonal drawings of graphs
cites work: Computing multivariate polynomials in parallel
full work available at URL: s0925-7721(97)00026-6
OpenAlex ID: W2117205241
description: scientific article; zbMATH DE number 1140209