Sparse topologies with small spectrum size
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1688366
- Spectral sparsification of graphs
- scientific article; zbMATH DE number 29111
- A new sparse set topology
- On the sparse set topology
- Algorithms and Computation
- Sparse geometric graphs with small dilation
- Sparse spectrally arbitrary patterns
- Spectral sparsification of hypergraphs
- Spectral techniques applied to sparse random graphs
Cites work
- scientific article; zbMATH DE number 1688366 (Why is no real title available?)
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 43547 (Why is no real title available?)
- scientific article; zbMATH DE number 1196829 (Why is no real title available?)
- scientific article; zbMATH DE number 1424534 (Why is no real title available?)
- A group-theoretic model for symmetric interconnection networks
- A new 5‐arc‐transitive cubic graph
- An improved diffusion algorithm for dynamic load balancing.
- Efficient schemes for nearest neighbor load balancing
- First- and second-order diffusive methods for rapid, coarse, distributed load balancing
- Open problems of Paul Erd�s in graph theory
- Random shuffles and group representations
- Strongly regular graphs
- The spectrum of de Bruijn and Kautz graphs
Cited in
(4)
This page was built for publication: Sparse topologies with small spectrum size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1885049)