A new fast heuristic for labeling points

DOI10.1016/j.ipl.2009.01.011zbMath1209.68179OpenAlexW2075622169MaRDI QIDQ987799

Subhas C. Nandy, Sasanka Roy, Sandip Das, Subhasis Bhattacharjee

Publication date: 16 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.01.011

zbMATH Keywords

algorithmbipartite graphplanar graphmaximum independent setpoint labeling

Mathematics Subject Classification ID

Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Unnamed Item
• Unnamed Item
• A polynomial time solution for labeling a rectilinear map
• Labeling a rectilinear map more efficiently
• Optimal algorithm for a special point-labeling problem
• Label placement by maximum independent set in rectangles
• Point labeling with sliding labels
• Generation of maximum independent sets of a bipartite graph and maximum cliques of a circular-arc graph
• A UNIFIED APPROACH TO AUTOMATIC LABEL PLACEMENT
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Three rules suffice for good label placement

This page was built for publication: A new fast heuristic for labeling points