Pages that link to "Item:Q1262782"
From MaRDI portal
The following pages link to Constructing disjoint paths on expander graphs (Q1262782):
Displayed 5 items.
- The cover time of a regular expander is O(n log n) (Q918708) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Approximations for the disjoint paths problem in high-diameter planar networks (Q1273862) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- Expander graphs and their applications (Q3514498) (← links)