A new fast heuristic for labeling points (Q987799): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Label placement by maximum independent set in rectangles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5452284 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Point labeling with sliding labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time solution for labeling a rectilinear map / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal algorithm for a special point-labeling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Labeling a rectilinear map more efficiently / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4792739 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three rules suffice for good label placement / rank
 
Normal rank

Latest revision as of 02:52, 3 July 2024

scientific article
Language Label Description Also known as
English
A new fast heuristic for labeling points
scientific article

    Statements

    A new fast heuristic for labeling points (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 August 2010
    0 references
    0 references
    algorithm
    0 references
    point labeling
    0 references
    maximum independent set
    0 references
    bipartite graph
    0 references
    planar graph
    0 references
    0 references