Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (Q5949570)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1676032
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search |
scientific article; zbMATH DE number 1676032 |
Statements
Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search (English)
0 references
21 November 2001
0 references
NC-algorithms
0 references
lexicographic search problems
0 references
reducible flow graphs
0 references
0.9022098183631896
0 references
0.9022098183631896
0 references
0.801972508430481
0 references
0.7946404814720154
0 references
0.7932606935501099
0 references
