Constructing disjoint paths on expander graphs (Q1262782)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Constructing disjoint paths on expander graphs |
scientific article; zbMATH DE number 4125030
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Constructing disjoint paths on expander graphs |
scientific article; zbMATH DE number 4125030 |
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
