Abstract
We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. As a corollary, we obtain a randomized NC algorithm for the problem of constructing a graph satisfying a sequence d 1, d2,..., d n of equality degree constraints. We provide an optimal NC algorithm for the decision version of the degree sequence problem and an approximation NC algorithm for the construction version of this problem. Our main result is an NC algorithm for constructing if possible a graph satisfying the degree constraints d 1, d 2,..., d n in case d i ≤ \(\sqrt {\Sigma _{j = 1}^n d_j /5 }\)for i=1, ..., n.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Takao Asano. Graphical Degree Sequence Problems with Connectivity Requirements. Proc. ISAAC'93, Hong Kong, Springer, LNCS 762, pp. 88–97.
B. Awerbuch, A. Israeli, Y. Shiloach. Finding Euler circuits in logarithmic parallel time. Proc. STOC, 1984, pp. 249–257.
C. Berge. Graphs and hypergraphs. North-Holland, American Elsevier, Amsterdam-London-New York (1973).
E. Cohen. Approximate max flow on small depth networks. Proc. 33rd FOCS, 1992, pp. 648–658.
R. Cole. Parallel merge sort. SIAM J. Computing, 17, (1988), pp. 770–785.
K. Diks, O. Garrido, A. Lingas. Parallel algorithms for finding maximal k-dependent sets and maximal f-matchings. Proc. ISA 91, Taipei, Springer, LNCS 557, pp. 385–395.
P. Erdös and T. Gallai. Graphs with prescribed degrees. Mat. Lapok 11, 1960, pp. 139–144.
Z. Galil and V. Pan. Improved processor bounds for combinatorial problems in RNC. Combinatorica, 8, 1988, pp. 189–200.
M. Goldberg, T. Spencer. A new parallel algorithm for the maximal independent set problem. Proc. 28th FOCS, 1987.
H.J. Karloff. A Las Vegas RNC algorithm for maximum matching. Combinatorica 6(4), pp. 387:391, 1986.
R. M. Karp and V. Ramachandran. Parallel algorithms for shared memory machines. In: J. van Leeuwen, ed., Handbook of Theoretical Computer Science, Vol. A (Elsevier Science Publishers, Amsterdam, 1990) 869–941.
R.M. Karp, E. Upfal, and A. Wigderson. Constructing a Maximum Matching is in Random NC. Combinatorica, 6(1), (1986) pp. 35–48.
A. Maheshwari. Personal communication.
S. Micali and V.V. Vazirani. An O(√¦V∥E¦) Algorithm for Finding Maximum Matching in General Graphs. Proc. 21st FOCS (1980), pp. 17–27.
K. Mulmuley, U.V. Vazirani, and V.V. Vazirani. Matching is as easy as matrix inversion. Combinatorica 7(1), pp. 105–113.
W.T. Tutte. A Short Proof of the Factor Theorem for Finite Graphs. Canad. J. Math 6, 1954, pp. 347–352.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dessmark, A., Lingas, A., Garrido, O. (1994). On parallel complexity of maximum f-matching and the degree sequence problem. In: Prívara, I., Rovan, B., Ruzička, P. (eds) Mathematical Foundations of Computer Science 1994. MFCS 1994. Lecture Notes in Computer Science, vol 841. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-58338-6_78
Download citation
DOI: https://doi.org/10.1007/3-540-58338-6_78
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58338-7
Online ISBN: 978-3-540-48663-3
eBook Packages: Springer Book Archive