Many-to-One Boundary Labeling with Backbones

DOI10.7155/jgaa.00379zbMath1328.05160arXiv1308.6801OpenAlexW2400613324MaRDI QIDQ5899631

Ignaz Rutter, Sabine Cornelsen, Michael A. Bekos, Martin Nöllenburg, Seok-Hee Hong, Michael Kaufmann, Martin Fink, Antonios Symvonis

Publication date: 7 January 2016

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

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

zbMATH Keywords

dynamic programming algorithmsboundary labeling problemcrossing-free backbone labelings

Mathematics Subject Classification ID

Dynamic programming (90C39) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

Faster multi-sided one-bend boundary labelling ⋮ Planar drawings of fixed-mobile bigraphs ⋮ Boundary Labeling for Rectangular Diagrams

This page was built for publication: Many-to-One Boundary Labeling with Backbones