#### Filter Results:

#### Publication Year

1991

1998

#### Publication Type

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

We show how to extend the RNC-algorithm for maximal match-ings due to Israeli-Itai (presented in 5]) to compute maximal (with respect to set of edges inclusion) f-matchings. Our algorithm works in O(log 2 n) time on an arbitrary Crcw Pram with a linear number of processors. Also we slightly improve a constant coeecient in the analysis of the Israeli-Itai… (More)

Let k be a positive integer, a subset Q of the set of vertices of a graph G is k-dependent in G if each vertex of Q has no more than k neighbours in Q. We present a parallel algorithm which computes a maximal k-dependent set in a graph on n nodes in time O(log 4 n) on an EREW PRAM with O(n 2) processors. In this way, we establish the membership of the… (More)

We present a randomized NC solution to the problem of constructing a maximum (cardinality) f-matching. As a corollary, we obtain a randomized NC algorithm for the problem of constructing a graph satisfying a sequence d 1 ; d 2 ;...; d n of equality degree constraints. We provide an optimal NC algorithm for the decision version of the degree sequence problem… (More)

- ‹
- 1
- ›