Geometric Planar Networks on Bichromatic Points
Computational Geometry
2022-07-19 v2 Data Structures and Algorithms
Abstract
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the Euclidean plane, and many of them are NP-hard. In this work, we consider these problems for collinear points. We show that almost all of these problems can be solved in linear time in this setting.
Cite
@article{arxiv.1911.08924,
title = {Geometric Planar Networks on Bichromatic Points},
author = {Sayan Bandyapadhyay and Aritra Banik and Sujoy Bhore and Martin Nöllenburg},
journal= {arXiv preprint arXiv:1911.08924},
year = {2022}
}
Comments
Appeared in Theoretical Computer Science (TCS) 2021