IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (Q4485123): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
Created claim: Wikidata QID (P12): Q126251894, #quickstatements; #temporary_batch_1719280132499 |
||
| (One intermediate revision by one other user not shown) | |||
| Property / cites work | |||
| Property / cites work: A PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH FIRST SEARCH / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Planar Depth-First Search in $O(\log n)$ Parallel Time / 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: A Simple Parallel Algorithm for the Maximal Independent Set Problem / rank | |||
Normal rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q126251894 / rank | |||
Normal rank | |||
Latest revision as of 04:05, 25 June 2024
scientific article; zbMATH DE number 1455584
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH |
scientific article; zbMATH DE number 1455584 |
Statements
IMPROVED PARALLEL ALGORITHM FOR MAXIMAL MATCHING BASED ON DEPTH-FIRST-SEARCH (English)
0 references
12 March 2001
0 references
depth first search tree
0 references
