Constructing disjoint paths on expander graphs (Q1262782): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: David Peleg / rank | |||
Property / author | |||
Property / author: Eli Upfal / rank | |||
Property / author | |||
Property / author: David Peleg / rank | |||
Normal rank | |||
Property / author | |||
Property / author: Eli Upfal / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eigenvalues and expanders / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expanding graphs contain all small trees / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4198056 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Parallel hashing / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Constructing a perfect matching is in random NC / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3048571 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Matching is as easy as matrix inversion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Token Distribution Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph minors. VI. Disjoint paths across a disc / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Scheme for Fast Parallel Communication / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 10:41, 20 June 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