@inproceedings{d71e5cb335e34481be70adb04052b029,
title = "CONSTRUCTING A PERFECT MATCHING IS IN RANDOM NC.",
abstract = "It is shown that the problem of constructing a perfect matching in a graph is in the complexity class Random NC; i. e. , the problem is solvable in polylog time by a randomized parallel algorithm using a polynomial-bounded number of processors. It is also shown that several related problems lie in Random NC. These include: constructing a perfect matching of maximum weight in a graph whose edge weights are given in unary notation; constructing a maximum-cardinality matching; constructing a matching covering a set of vertices of maximum weight in a graph whose vertex weights are given in binary; and constructing a maximum s - t flow in a directed graph whose edge weights are given in unary.",
author = "Karp, {Richard M.} and Eli Upfal and Avi Wigderson",
year = "1985",
doi = "10.1145/22145.22148",
language = "אנגלית",
isbn = "0897911512",
series = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
publisher = "ACM (Order n 508850)",
pages = "22--32",
booktitle = "Conference Proceedings of the Annual ACM Symposium on Theory of Computing",
}