Clean the graph before you draw it!
type: Item
instance of: scholarly article
title: Clean the graph before you draw it!
zbMATH Open document ID: 1209.68369
author: Serge Gaspers
author: Margaret-Ellen Messinger
author: R. J. Nowakowski
author: Paweł Prałat
published in: Information Processing Letters
publication date: 2010-08-16T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68Q25
zbMATH DE Number: 5771241
zbMATH Keywords: brush number
zbMATH Keywords: balanced vertex-ordering
zbMATH Keywords: graph algorithms
zbMATH Keywords: computational complexity
MaRDI profile type: Publication
full work available at URL: j.ipl.2009.01.003
OpenAlex ID: W2044593143
cites work: Cleaning Regular Graphs with Brushes
cites work: Balanced vertex-orderings of graphs
cites work: Parallel cleaning of a network with brushes
cites work: Drawing planar graphs using the canonical ordering
cites work: Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
cites work: Q5387696
cites work: Cleaning a network with brushes
cites work: Cleaning Random d-Regular Graphs with Brushes Using a Degree-Greedy Algorithm
cites work: Algorithms for area-efficient orthogonal drawing
cites work: Q3614030
cites work: Minimising the number of bends and volume in 3-dimensional orthogonal graph drawings with a diagonal vertex layout
cites work: Optimal three-dimensional orthogonal graph drawing in the general position model.
DOI: 10.1016/J.IPL.2009.01.003
description: scientific article; zbMATH DE number 5771241