Computing a perfect matching in a line graph
We show in this paper that a perfect matching of a line graph can be computed in NC. A necessary and sufficient condition for a line graph to have a perfect matching is an even number of vertices. To compute the perfect matching, we use a technique of dividing the graph into kingdoms. This result is equivalent to partitioning the edge set of a graph into edge disjoint paths of even length.
Unable to display preview. Download preview PDF.
- [CN]Marek Chrobak and Joseph Naor, “Perfect Matchings in Claw Free Graphs”, In preparation.Google Scholar
- [GM]D. Y. Grigoriev and M. Karpinski, “The Matching Problem for Bipartite Graphs with Polynomially Bounded Permanents is in NC”, 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987.Google Scholar
- [GS]M. Goldberg and T. Spencer, “A New Parallel Algorithm for the Maximal Independent Set Problem”, 28th Annual IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, 1987.Google Scholar
- [L]M. Luby, “A simple parallel algorithm for the maximal independent set”, Siam Journal on Computing, Vol. 15, 4, (1986).Google Scholar
- [S]D. P. Sumner, “On Tutte's Factorization Theorem”, Proceedings of the Capital Conference on Graph Theory and Combinatorics, George Washington University, Washington D.C., 1973, pp. 350–355. Lecture Notes in Math., Vol. 406, Springer, Berlin, 1974.Google Scholar