Trimming of graphs, with application to point labeling (Q1959389): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Erlebach, Thomas / rank
Normal rank
 
Property / author
 
Property / author: Erlebach, Thomas / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-009-9184-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2157796928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for NP-complete problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3836521 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on tree decomposition of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time algorithms for three-label point labeling. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity Results for Bandwidth Minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for covering and packing problems in image processing and VLSI / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\epsilon\)-nets and simplex range queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approximation algorithm for labeling points with circle pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling points with weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2753953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. II. Algorithmic aspects of tree-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point labeling with sliding labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: LABELING POINTS WITH CIRCLES / rank
 
Normal rank

Latest revision as of 07:42, 3 July 2024

scientific article
Language Label Description Also known as
English
Trimming of graphs, with application to point labeling
scientific article

    Statements

    Trimming of graphs, with application to point labeling (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    6 October 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    trimming weighted graphs
    0 references
    domino treewidth
    0 references
    planar graphs
    0 references
    layer bandwidth
    0 references
    point-feature label placement
    0 references
    map labeling
    0 references
    sliding labels
    0 references
    polynomial-time approximation schemes
    0 references
    0 references