Showing papers by "William F. Smyth published in 1992"
TL;DR: The class of K-restrained graphs includes all K-connected and K-edge-connected graphs, as well as all connected K-regular graphs, and an upper bound on the diameter of three of these four classes of graphs is known.
31 citations
06 Jan 1992
TL;DR: An O(log n) time CRCW PRAM algorithm for computing the least lexicographic rotation of a circular string (of length n) over a fixed alphabet is presented here.
Abstract: An O(log n) time CRCW PRAM algorithm for computing the least lexicographic rotation of a circular string (of length n) over a fixed alphabet is presented here. The logarithmic running time is achieved by using O(nlog n)processors and its space complexity is linear. A second algorithm for unbounded alphabets requires O(log n log log n) units of time, also using O(nlog n) processors.
27 citations
01 Jan 1992
26 citations