Pages that link to "Item:Q1162529"
From MaRDI portal
The following pages link to The complexity of testing whether a graph is a superconcentrator (Q1162529):
Displayed 9 items.
- Highly symmetric expanders (Q700158) (← links)
- Combinatorial analysis (nonnegative matrices, algorithmic problems) (Q1060220) (← links)
- Eigenvalues and expanders (Q1112844) (← links)
- The symbiotic relationship of combinatorics and matrix theory (Q1183182) (← links)
- Multi-processor scheduling and expanders (Q1336770) (← links)
- Computation of best possible low degree expanders (Q2462391) (← links)
- Minimal selectors and fault tolerant networks (Q3057156) (← links)
- NONEXISTENCE OF A CIRCULANT EXPANDER FAMILY (Q3080191) (← links)
- Expander graphs and their applications (Q3514498) (← links)