Parallel complexity of computing a maximal set of disjoint paths (Q1186594): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:12, 30 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallel complexity of computing a maximal set of disjoint paths |
scientific article |
Statements
Parallel complexity of computing a maximal set of disjoint paths (English)
0 references
28 June 1992
0 references
parallel complexity
0 references
maximal path problem
0 references
depth-first search
0 references
NC
0 references
PRAMs
0 references
polylogarithmic time
0 references
