Optimal algorithm for a special point-labeling problem

DOI10.1016/j.ipl.2003.10.002zbMath1178.68650OpenAlexW2002755229MaRDI QIDQ1029054

Partha P. Goswami, Sandip Das, Sasanka Roy, Subhas C. Nandy

Publication date: 9 July 2009

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

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

zbMATH Keywords

complexityalgorithmsanalysis of algorithmschordal graphsmap labeling

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Nonnumerical algorithms (68W05)

Related Items (2)

A new fast heuristic for labeling points ⋮ DETERMINING A SET OF MAXIMUM INSCRIBED RECTANGLES FOR LABEL PLACEMENT IN A REGION

Cites Work

• Unnamed Item
• Unnamed Item
• Labeling a rectilinear map more efficiently
• Label placement by maximum independent set in rectangles
• Point labeling with sliding labels
• Efficient algorithms for interval graphs and circular-arc graphs
• Three rules suffice for good label placement

This page was built for publication: Optimal algorithm for a special point-labeling problem