An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs.
| Izdano u: | Information processing letters. 61, 6 (1997). |
|---|---|
| Glavni autor: | |
| Format: | Članak |
| Jezik: | English |
| Teme: |
| Izdano u: | Information processing letters. 61, 6 (1997). |
|---|---|
| Glavni autor: | |
| Format: | Članak |
| Jezik: | English |
| Teme: |