Journal of Algorithms

Paper

01 Jan 1982

An O(logn) parallel connectivity algorithm

View publication

Abstract

No abstract available.

Related

Paper

Complexity of finding k-path-free dominating sets in graphs

Reuven Bar-Yehuda, Uzi Vishkin

Information Processing Letters

Paper

On finding a minimum dominating set in a tournament

Nimrod Megiddo, Uzi Vishkin

Theoretical Computer Science

Paper

An O(n²log n) parallel max-flow algorithm

Yossi Shiloach, Uzi Vishkin

Journal of Algorithms

Paper

A fast algorithm for solving systems of linear equations with two variables per equation

Bengt Aspvall, Yossi Shiloach

Linear Algebra and Its Applications

View all publications