for this problem, in Chapter 2 we give sublinear time algorithms for finding a perfect matching in a regular bipartite graph using sparsification and random ...
確定! 回上一頁