Planar bichromatic bottleneck spanning trees

DOI10.20382/jocg.v12i1a5OpenAlexW3194433112MaRDI QIDQ4958386

Joseph S. B. Mitchell, A. Karim Abu-Affash, Sujoy Bhore, Paz Carmi

Publication date: 7 September 2021

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

Mathematics Subject Classification ID

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

This page was built for publication: Planar bichromatic bottleneck spanning trees