scientific article; zbMATH DE number 7559108
From MaRDI portal
Publication:5090445
DOI10.4230/LIPIcs.ITCS.2019.65MaRDI QIDQ5090445
Publication date: 18 July 2022
Full work available at URL: https://arxiv.org/abs/1811.10834
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (1)
Cites Work
- Unnamed Item
- Metric uniformization and spectral bounds for graphs
- The electrical resistance of a graph captures its commute and cover times
- Nearly Linear Time Algorithms for Preconditioning and Solving Symmetric, Diagonally Dominant Linear Systems
- Improved Bounds for Mixing Rates of Markov Chains and Multicommodity Flow
- A semidefinite bound for mixing rates of Markov chains
- Unranking and ranking spanning trees of a graph
- Fast Generation of Random Spanning Trees and the Effective Resistance Metric
- A Cheeger Inequality for the Graph Connection Laplacian
- Multi-way spectral partitioning and higher-order cheeger inequalities
- Many sparse cuts via higher eigenvalues
- Improved Cheeger's inequality
This page was built for publication: