Geometric planar networks on bichromatic points

DOI10.1007/978-3-030-39219-2_7zbMath1453.68122arXiv1911.08924OpenAlexW3000944034MaRDI QIDQ779176

Sayan Bandyapadhyay, Martin Nöllenburg, Sujoy Bhore, Aritra Banik

Publication date: 21 July 2020

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (2)

The balanced connected subgraph problem ⋮ 2-colored point-set embeddings of partial 2-trees

This page was built for publication: Geometric planar networks on bichromatic points