Searching for authors named "Yannis Manoussakis" – sorted by Relevance.
-
Parallel Algorithms for the Hamiltonian Cycle and Hamiltonian Path Problems in Semicomplete Bipartite Digraphs
- We give an O(log 4 n)-time O(n 2 )-processor CRCW PRAM algorithm to find a hamiltonian cycle in a strong semicomplete bipartite digraph, B, provided that a factor of B (i.e. a collection of vertex disjoint cycles covering the vertex set of B) is computed in a preprocessing step. The factor is f
- Cited by 4 (2 self) – Add To MetaCart

