Trimming of graphs, with application to point labeling
type: Item
instance of: scholarly article
title: Trimming of graphs, with application to point labeling
zbMATH Open document ID: 1225.05212
author: Torben Hagerup
author: Klaus Jansen
author: Moritz Minzlaff
author: Alexander Wolff
author: Thomas Erlebach
published in: Theory of Computing Systems
publication date: 2010-10-06T00:00:00Z
Mathematics Subject Classification ID: 05C78
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C75
Mathematics Subject Classification ID: 05C20
zbMATH DE Number: 5796566
zbMATH Keywords: trimming weighted graphs
zbMATH Keywords: domino treewidth
zbMATH Keywords: planar graphs
zbMATH Keywords: layer bandwidth
zbMATH Keywords: point-feature label placement
zbMATH Keywords: map labeling
zbMATH Keywords: sliding labels
zbMATH Keywords: polynomial-time approximation schemes
MaRDI profile type: Publication
full work available at URL: s00224-009-9184-8
OpenAlex ID: W2157796928
cites work: Label placement by maximum independent set in rectangles
cites work: Approximation algorithms for NP-complete problems on planar graphs
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: Q3836521
cites work: Some results on tree decomposition of graphs
cites work: Polynomial time algorithms for three-label point labeling.
cites work: Complexity Results for Bandwidth Minimization
cites work: Approximation schemes for covering and packing problems in image processing and VLSI
cites work: \(\epsilon\)-nets and simplex range queries
cites work: A new approximation algorithm for labeling points with circle pairs
cites work: Labeling points with weights
cites work: Q2753953
cites work: Graph minors. II. Algorithmic aspects of tree-width
cites work: Point labeling with sliding labels
cites work: LABELING POINTS WITH CIRCLES
DOI: 10.1007/S00224-009-9184-8
description: scientific article; zbMATH DE number 5796566