Can I read Efficient Algorithms for the 2-Gathering Problem on EtoBox?

Efficient Algorithms for the 2-Gathering Problem by Alon Shalita; Uri Zwick is a Computer Science article available to read on EtoBox.

What is Efficient Algorithms for the 2-Gathering Problem about?

Pebbles are placed on some vertices of a directed graph. Is it possible to move each pebble along at most one edge of the graph so that in the final configuration no pebble is left on its own? We give an __O__ ( __mn__ )-time algorithm for solving this problem, which we call the __2-gathering__ problem, where __n__ is the number of vertices and __m__ is the number of edges of the graph. If such a 2-gathering is not possible, the algorithm finds a solution that minimizes the number of solitary pebbles. The 2-gathering problem forms a nontrivial generalization of the nonbipartite matching problem and it is solved by extending the augmenting paths technique used to solve matching problems.

Who reads Efficient Algorithms for the 2-Gathering Problem?

Author

Alon Shalita; Uri Zwick

Publisher

ACM

Published

2010

Language

EN

Field

Computer Science (Physical Sciences)