A sublinear-time randomized parallel algorithm for the maximum clique problem in perfect graphs
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Las Vegas O(n2.38 algorithm for the cardinality of a maximum matching
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Processor efficient parallel matching
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Approximating weighted matchings in parallel
Information Processing Letters
The matching problem for bipartite graphs with polynomially bounded permanents is in NC
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Randomness and completeness in computational complexity
Randomness and completeness in computational complexity
| Hi-index | 0.00 |