Parallel complexity of computing a maximal set of disjoint paths (Q1186594)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 36837
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parallel complexity of computing a maximal set of disjoint paths |
scientific article; zbMATH DE number 36837 |
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
0.9284642
0 references
0.9236783
0 references
0.91624177
0 references
0.9095724
0 references
0.8934895
0 references
0.8923404
0 references
