M.F. Cowlishaw
IBM Systems Journal
Paper
Yet another distributed depth-first-search algorithm
Abstract
A new distributed depth-first-search algorithm is presented whose communication and time complexities are bounded by 3|E| and 2|V|, respectively. © 1988.
Related
Conference paper
Optimization algorithms for energy-efficient data centers
Hendrik F. Hamann
InterPACK 2013
Conference paper
Automatic taxonomy generation: Issues and possibilities
Raghu Krishnapuram, Krishna Kummamuru
IFSA 2003
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory