A remark on maximum matching of line graphs. (English) Zbl 0886.05095
Summary: For an undirected graph \(G=(V, E)\), a maximum matching of the line graph \(L(G)\) can be found in \(\text{NC}^2\).
MSC:
| 05C70 | Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) |
| 68Q25 | Analysis of algorithms and problem complexity |
References:
| [1] | Aggarwal, A.; Anderson, R. J., A random NC algorithm for depth first search, Combinatorica, 8, 1-12 (1988) · Zbl 0647.68060 |
| [2] | Karp, R. M.; Ramachandran, V., Parallel algorithms for shared-memory machines, (Handbook of Theoretical Computer Science, Vol. A (1990), Elsevier: Elsevier Amsterdam), 869-941 · Zbl 0900.68267 |
| [3] | R.M. Karp, E. Upfal, A. Wigderson, Constructing a perfect matching is in random NC, Proc. 17th ACM STOC, pp. 22-32.; R.M. Karp, E. Upfal, A. Wigderson, Constructing a perfect matching is in random NC, Proc. 17th ACM STOC, pp. 22-32. · Zbl 0646.05051 |
| [4] | Masuyama; Ibaraki, T., Chain packing in graphs, Algorithmica, 6, 826-839 (1991) · Zbl 0731.68088 |
| [5] | Shiloach, Y.; Vishkin, U., An O(log \(n)\) parallel connectivity algorithm, J. Algorithms, 3, 57-63 (1982) · Zbl 0494.68070 |
| [6] | Tarjan, R. E.; Vishkin, U., An efficient parallel biconnectivity algorithm, SIAM J. Comput., 14, 4, 862-874 (1985) · Zbl 0575.68066 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
