#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1991

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Krzysztof Diks, Oscar Garrido, Andrzej Lingas
- ISA
- 1991

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)

- Oscar Garrido, Stefan Jarominek, Andrzej Lingas, Wojciech Rytter
- Inf. Process. Lett.
- 1992

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)

- Anders Dessmark, Andrzej Lingas, Oscar Garrido
- MFCS
- 1994

- Oscar Garrido, Pierre Kelsen, Andrzej Lingas
- Inf. Process. Lett.
- 1996

- Oscar Garrido
- 1993

Graphs are the most widely used of all mathematical structures. There is uncountable number of interesting computational problems de ned in terms of graphs. A graph can be seen as a collection of vertices (V ), and a collection of edges (E) joining all or some of the vertices. One is very often interested in nding subsets, either from the set V of vertices… (More)

- Anders Dessmark, Oscar Garrido, Andrzej Lingas
- Inf. Process. Lett.
- 1998

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)

- Oscar Garrido
- 2007

When is a sequence of integers realizable as the degree sequence of a graph? There are well known necessary and suucient conditions for a sequence of integers to constitute degrees of a graph 1]. There exists a sequential linear time algorithm that construct a graph from a given degree sequence. This algorithm however seems to be inherenty sequencial, and… (More)

- ‹
- 1
- ›