Trimming of Graphs, with Application to Point Labeling
From MaRDI portal
Publication:4910725
DOI10.4230/LIPIcs.STACS.2008.1350zbMath1258.05043arXiv0802.2854MaRDI QIDQ4910725
Alexander Wolff, Erlebach, Thomas, Moritz Minzlaff, Torben Hagerup, Klaus Jansen
Publication date: 19 March 2013
Full work available at URL: https://arxiv.org/abs/0802.2854
planar graphsmap labelingpolynomial-time approximation schemesdomino treewidthpoint-feature label placementtrimming weighted graphsvertex-weighted graphslabeling weighted pointstrimmable graphs
Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Signed and weighted graphs (05C22)
Related Items
Trimming weighted graphs of bounded treewidth ⋮ Approximation algorithms for free-label maximization ⋮ Matching points with rectangles and squares