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...

Descripción completa

Detalles Bibliográficos
Autores principales: Forster, Sebastian, de Vos, Tijn
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Springer US 2022
Materias:
Article
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

Internet

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

Ejemplares similares