Zeitschriftenartikel:
S. Bandyapadhyay, A. Banik, S. Bhore, M. Nöllenburg:
"Geometric planar networks on bichromatic collinear points";
Theoretical Computer Science,
895
(2021),
S. 124
- 136.
Kurzfassung englisch:
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.
"Offizielle" elektronische Version der Publikation (entsprechend ihrem Digital Object Identifier - DOI)
http://dx.doi.org/10.1016/j.tcs.2021.09.035
Erstellt aus der Publikationsdatenbank der Technischen Universität Wien.