Parallelism and the maximal path problem (Q1098641): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/0020-0190(87)90105-0 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2081298180 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A taxonomy of problems with fast parallel algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Parallelism in random access machines / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4128417 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An optimal parallel connectivity algorithm / rank | |||
Normal rank | |||
Latest revision as of 16:07, 18 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parallelism and the maximal path problem |
scientific article |
Statements
Parallelism and the maximal path problem (English)
0 references
1987
0 references
computational complexity
0 references
parallel algorithm
0 references
P-completeness
0 references
maximal path problem
0 references
planar graphs
0 references
