The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
We obtain the first approximation algorithm for finding the k-simple shortest paths connecting a pair of vertices in a weighted directed graph. Our algorithm is deterministic an...
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
Tassos Dimitriou, Sotiris E. Nikoletseas, Paul G. ...