Efficient algorithms for the 2-gathering problem

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.

[1]  András Sebö,et al.  General Antifactors of Graphs , 1993, J. Comb. Theory, Ser. B.

[2]  R. Baker.  Factorization of graphs , 1975 .

[3]  Gérard Cornuéjols,et al.  General factors of graphs , 1988, J. Comb. Theory, Ser. B.

[4]  Robert E. Tarjan,et al.  A linear-time algorithm for a special case of disjoint set union , 1983, J. Comput. Syst. Sci..

[5]  Gérard Cornuéjols,et al.  Packing subgraphs in a graph , 1982, Oper. Res. Lett..

[6]  Harold N. Gabow,et al.  An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems , 1983, STOC.

[7]  David G. Kirkpatrick,et al.  Packings by cliques and by finite families of graphs , 1984, Discret. Math..

[8]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[9]  Adriana Karagiozova.  Aspects of network design , 2007 .

[10]  David R. Karger,et al.  Building Steiner trees with incomplete global knowledge , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[11]  L. Lovász.  The factorization of graphs. II , 1972 .

[12]  Amitai Armon,et al.  On Min-Max r -Gatherings , 2007, WAOA.

[13]  László Lovász,et al.  Subgraphs with prescribed valencies , 1970 .

[14]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[15]  Sudipto Guha,et al.  Hierarchical placement and network design problems , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[16]  Rajeev Motwani,et al.  Clique partitions, graph compression and speeding-up algorithms , 1991, STOC '91.

[17]  J. Edmonds.  Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.

[18]  L~szl Lov~sz.  Subgraphs with Prescribed Valencies , 2006 .

[19]  Vijay V. Vazirani,et al.  A theory of alternating paths and blossoms for proving correctness of the $$O(\sqrt V E)$$ general graph maximum matching algorithm , 1990, Comb..

[20]  Elliot Anshelevich,et al.  Terminal backup, 3D matching, and covering cubic graphs , 2007, STOC '07.

[21]  Samir Khuller,et al.  Achieving anonymity via clustering , 2006, PODS '06.

[22]  Robert E. Tarjan,et al.  Faster scaling algorithms for general graph matching problems , 1991, JACM.

[23]  Zoya Svitkina,et al.  Lower-bounded facility location , 2008, SODA '08.