Parallel complexity of computing a maximal set of disjoint paths (Q1186594): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A random NC algorithm for depth first search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel Depth-First Search in General Directed Graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast and simple randomized parallel algorithm for maximal matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An efficient parallel algorithm for shifting the root of a depth first spanning tree / rank | |||
Normal rank | |||
Revision as of 17:07, 15 May 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
