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

Paper

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

Paper

Solving NP-Hard Problems on Graphs That Are Almost Trees and an Application to Facility Location Problems

Paper

Another look at the degree constrained subgraph problem

View all publications