Simplification of polyline bundles of graphs and trees

DOI10.20382/JOCG.V16I1A7MaRDI QIDQ6994345zbMATH OpenFDO

Authors Yannick Bosch, Peter Schäfer, Joachim Spoerhase, Sabine Storandt, Johannes Zink

Publication date 23 April 2025

Published in Journal of Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.20382/JOCG.V16I1A7

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Approximation algorithms (68W25)

This page was built for publication: Simplification of polyline bundles of graphs and trees

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