Constructing disjoint paths on expander graphs (Q1262782): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 09:38, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing disjoint paths on expander graphs |
scientific article |
Statements
Constructing disjoint paths on expander graphs (English)
0 references
1989
0 references
interconnection network
0 references
complexity
0 references
disjoint paths
0 references
expander interconnection graphs
0 references
Deterministic-\({\mathcal P}\)
0 references
Random-\({\mathcal N}{\mathcal C}\)
0 references
parallel-distributed model of computation
0 references
parallel algorithms
0 references
