Geometric planar networks on bichromatic points

DOI10.1007/978-3-030-39219-2_7zbMath1453.68122arXiv1911.08924MaRDI 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

68Q25: Analysis of algorithms and problem complexity

68R10: Graph theory (including graph drawing) in computer science

90C27: Combinatorial optimization

68U05: Computer graphics; computational geometry (digital and algorithmic aspects)

05C62: Graph representations (geometric and intersection representations, etc.)

Related Items

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