Boundary Labeling for Rectangular Diagrams

DOI10.4230/LIPIcs.SWAT.2018.12zbMath1477.68461arXiv1803.10812OpenAlexW2963350132MaRDI QIDQ5116476

Prosenjit Bose, Paz Carmi, J. Mark Keil, Saeed Mehrabi, Debajyoti Mondal

Publication date: 25 August 2020

Full work available at URL: https://arxiv.org/abs/1803.10812

zbMATH Keywords

dynamic programmingboundary labelingouterstring graphs

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Dynamic programming (90C39) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (1)

Faster multi-sided one-bend boundary labelling

Cites Work

• Unnamed Item
• Unnamed Item
• Multi-sided boundary labeling
• An algorithm for the maximum weight independent set problem on outerstring graphs
• Boundary labeling: Models and efficient algorithms for rectangular maps
• Boundary labeling with octilinear leaders
• On the Readability of Boundary Labeling
• Algorithms for Multi-Criteria Boundary Labeling
• Many-to-One Boundary Labeling with Backbones

This page was built for publication: Boundary Labeling for Rectangular Diagrams