Constrained boundary labeling

DOI10.1016/J.COMGEO.2025.102191MaRDI QIDQ6964862zbMATH OpenFDO

Authors Thomas Depian, Martin Nöllenburg, Soeren Terziadis, Markus Wallinger

Publication date 4 July 2025

Published in Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COMGEO.2025.102191

zbMATH Keywords

boundary labelingcomputational complexitydynamic programminggrouping constraintsordering constraints

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Cites work

• Algorithms for Multi-Criteria Boundary Labeling
• Boundary labeling with octilinear leaders
• Boundary labeling: Models and efficient algorithms for rectangular maps
• Breakpoint distance and PQ-trees
• Computational geometry. Algorithms and applications.
• Extending partial representations of interval graphs
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 7740898 (Why is no real title available?)
• Incidence matrices and interval graphs
• Many-to-one boundary labeling with backbones
• Multi-sided boundary labeling
• PC trees and circular-ones arrangements.
• Planarity algorithms via PQ-trees (extended abstract)
• Symmetric rank covariances: a generalized framework for nonparametric measures of dependence
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• The complexity of satisfiability problems

This page was built for publication: Constrained boundary labeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6964862)