scispace - formally typeset
Search or ask a question

Showing papers by "Andrei Z. Broder published in 1991"


Proceedings ArticleDOI
03 Jan 1991
TL;DR: An 0(cZn3) steps algorithm A is described, and it is proved that it succeeds almost surely to find hidden Hamiltonian cycles in a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges.
Abstract: Consider a random graph G composed of a Hamiltonian cycle on n labeled vertices and dn random edges that “high” the cycle. Is it possible to unravel the structures, that is, to efficiently find a Himiltonian cycle in G? We describe an O(n3 log n)-step algorithm A for this purpose, and prove that it succeeds almost surely. Part one of A properly covers the “trouble spots” of G by a collection of disjoint paths. (This is the hard part to analyze). Part two of A extends this cover to a full cycle by the rotation-extension technique which is already classical for such problems. © 1994 John Wiley & Sons, Inc.

26 citations


Proceedings ArticleDOI
01 Mar 1991
TL;DR: An inherent limit at ion is proved on the speedup achievable, and an algorithm is given that achieves its best performance bounds on trees of the sort that are likely to arise in game-playing programs.
Abstract: We consider efficient parallel algorithms for the evaluat ion of game trees. We prove an inherent limit at ion on the speedup achievable, and give an algorithm that achieves its best performance bounds on trees of the sort that are likely to arise in game-playing programs.

8 citations