2017
Faster algorithms for the minimum redbluepurple spanning graph problem
Publication
Publication
Journal of Graph Algorithms and Applications , Volume 21  Issue 4 p. 527 546
Consider a set of n points in the plane, each one of which is colored either red, blue, or purple. A redbluepurple spanning graph (RBP spanning graph) is a graph whose vertices are the points and whose edges connect the points such that the subgraph induced by the red and purple points is connected, and the subgraph induced by the blue and purple points is connected. The minimum RBP spanning graph problem is to find an RBP spanning graph with minimum total edge length. First we consider this problem for the case when the points are located on a circle. We present an algorithm that solves this problem in O(n2) time, improving upon the previous algorithm by a factor of Θ(n). Also, for the general case we present an algorithm that runs in O(n5) time, improving upon the previous algorithm by a factor of Θ(n).
Additional Metadata  

dx.doi.org/10.7155/jgaa.00427  
Journal of Graph Algorithms and Applications  
Organisation  Computational Geometry Lab 
Biniaz, A. (Ahmad), Bose, P, van Duijn, I. (Ingo), Maheshwari, A, & Smid, M. (2017). Faster algorithms for the minimum redbluepurple spanning graph problem. Journal of Graph Algorithms and Applications, 21(4), 527–546. doi:10.7155/jgaa.00427
