A randomized NC algorithm for the maximal tree cover problem (Q1183479): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| 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 the maximal independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3197350 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved parallel algorithm that computes the BFS numbering of a directed graph / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An improved parallel algorithm for maximal matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallel algorithms for the connected components and minimal spanning tree problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3361905 / rank | |||
Normal rank | |||
Latest revision as of 15:48, 15 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A randomized NC algorithm for the maximal tree cover problem |
scientific article |
Statements
A randomized NC algorithm for the maximal tree cover problem (English)
0 references
28 June 1992
0 references
maximal tree cover problem
0 references
randomized NC algorithm
0 references
EREW PRAM
0 references
0 references
