A fast and efficient NC algorithm for maximal matching (Q1352118): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Parallel Symmetry-Breaking in Sparse 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 improved parallel algorithm for maximal matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A fast parallel algorithm for the maximal independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4385522 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal parallel algorithm for maximal matching / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank | |||
Normal rank | |||
Revision as of 11:13, 27 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A fast and efficient NC algorithm for maximal matching |
scientific article |
Statements
A fast and efficient NC algorithm for maximal matching (English)
0 references
27 February 1997
0 references
Parallel algorithms
0 references
Maximal matching
0 references
NC
0 references
RNC
0 references
