Parallel algorithms for finding Hamilton cycles in random graphs
Information Processing Letters
Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
An algorithm for finding Hamilton paths and cycles in random graphs
Combinatorica - Theory of Computing
A simple linear expected time algorithm for finding a Hamilton path
Discrete Mathematics
Converting high probability into nearly-constant time—with applications to parallel hashing
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Towards a theory of nearly constant time parallel algorithms
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Load balancing requires &OHgr;(log*n) expected time
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Graphs and Hypergraphs
Closed loop motion planning of cooperating mobile robots using graph connectivity
Robotics and Autonomous Systems
A distributed algorithm to find hamiltonian cycles in g(np) random graphs
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
| Hi-index | 0.00 |