Pages that link to "Item:Q1262782"
From MaRDI portal
The following pages link to Constructing disjoint paths on expander graphs (Q1262782):
Displaying 11 items.
- The cover time of a regular expander is O(n log n) (Q918708) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← 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)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- The electrical resistance of a graph captures its commute and cover times (Q1386176) (← links)
- On fault-tolerant path optimization under QoS constraint in multi-channel wireless networks (Q2402675) (← links)
- Expander graphs and their applications (Q3514498) (← links)
- Existence and Construction of Edge-Disjoint Paths on Expander Graphs (Q4312418) (← links)
- Short vertex disjoint paths and multiconnectivity in random graphs: Reliable network computing (Q4632452) (← links)
- Shortest edge-disjoint paths in graphs (Q5096182) (← links)