Abstract
We address the problem of approximating aminimum cycle cover in parallel. We give the first efficient parallel algorithm for finding an approximation to aminimum cycle cover. Our algorithm finds a cycle cover whose size is within a factor of 0(1 +n logn/(m + n) of the minimum-sized cover usingO(log2 n) time on (m + n)/logn processors.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
N. Alon and M. Tarsi. Covering multigraphs by simple circuits.SIAM J. Algebraic Discrete Methods,6:345–350, 1985.
B. Awerbach, A. Israeli, and Y. Shiloach. Finding Euler circuits in logarithmic parallel time. InProceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 249–257.
C. Berge.Graphs and Hypergraphs. North-Holland, Amsterdam, 1979.
R. Cole and U. Vishkin. Approximate and exact parallel scheduling with applications to list, tree, and graph problems. InProceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986, pp. 478–491.
H. Cross. Analysis of flow in networks of conduits of conductors. Bulletin 286, University of Illinois Engineering Experimental Station, Urbana, Illinois, 1936.
H. Gabow. Using Euler partitions to edge-color bipartite multigraphs.Internat. J. Comput. Inform. Sci.,5:345–355, 1976.
A. Itai, R. J. Lipton, C. H. Papadimitriou, and M. Rodeh. Covering graphs by simple circuits.SIAM J. Comput.,10(4):746–750, 1981.
A. Itai and M. Rodeh. Covering a graph by circuits. InProceeding of the ICALP Conference, Udine, 1978.
F. Jaeger. On nowhere-zero flow in muitigraphs. InProceedings of the Fifth British Combinatorial Conference, 1975, pp. 373–378.
H. Jung. An optimal parallel algorithm for computing connected components in a graph. Preprint, Humboldt University, Berlin, 1989.
R. Karp, E. Upfal, and A. Wigderson. Constructing a perfect matching is in randomNC. InProceedings of the 17th Annual ACM Symposium on Theory of Computing, 1985, pp. 22–32.
P. Klein and C. Stein. A parallel algorithm for eliminating cycles in undirected graphs.Inform. Process. Lett.,34(6):307–312, 1990.
G. F. Lev, N. Pippenger, and L. G. Valiant. A fast parallel algorithm for routing in permutation networks.IEEE Trans. Comput.,C-30:93–100, 1981.
L. Lovász. Computing ears and branchings in parallel. InProceedings of the 26th Annual Symposium on Foundations of Computer Science, 1985, pp. 464–467.
Y. Maon, B. Schieber, and U. Vishkin. Parallel ear decomposition search (EDS) andst-numbering in graphs. InVLSI Algorithms and Architectures, Lecture Notes in Computer Science 227, Springer-Verlag, Berlin, 1986, pp. 34–35.
B. Schieber and U. Vishkin. On finding lowest common ancestors: simplification and parallelization. InAegean Workshop on Computing, Lecture Notes in Computer Science 319, Springer-Verlag, Berlin, 1988, pp. 111–123.
P. D. Seymour. Nowhere-zero 6 flows.J. Combin. Theory Ser. B,30:130–135, 1981.
Y. Shiloach. Edge-disjoint branching in directed muitigraphs.Inform. Process. Lett.,8:24–27, 1979.
R. E. Tarjan. A good algorithm for edge-disjoint branchings.Inform. Process. Lett.,3:51–53, 1975.
R. E. Tarjan and U. Vishkin. Finding biconnected components and computing tree functions in logarithmic parallel time. InProceedings of the 16th Annual ACM Symposium on Theory of Computing, 1984, pp. 12–20.
Author information
Authors and Affiliations
Additional information
Communicated by Christos Papadimitriou.
Research supported by ONR Grant N00014-88-K-0243 and DARPA Grant N00039-88-C0113 at Harvard University.
Research supported by a graduate fellowship from GE. Additional support provided by Air Force Contract AFOSR-86-0078, and by an NSF PYI awarded to David Shmoys, with matching funds from IBM, Sun Microsystems, and UPS.
Rights and permissions
About this article
Cite this article
Klein, P., Stein, C. A parallel algorithm for approximating the minimum cycle cover. Algorithmica 9, 23–31 (1993). https://doi.org/10.1007/BF01185336
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01185336