Cargando…
Faster Cut Sparsification of Weighted Graphs
A cut sparsifier is a reweighted subgraph that maintains the weights of the cuts of the original graph up to a multiplicative factor of [Formula: see text] . This paper considers computing cut sparsifiers of weighted graphs of size [Formula: see text] . Our algorithm computes such a sparsifier in ti...
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer US
2022
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10060318/ https://www.ncbi.nlm.nih.gov/pubmed/37008076 http://dx.doi.org/10.1007/s00453-022-01053-4 |