Metraipolis › archive › dc_2b45fa34b180

An $m+n^{3/2}$ algorithm for counting spanning trees by $\ell_1$-regularized resistance — arXiv:2609.03574

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.03574
License (as archived)
CC0-1.0
Archived
2026-10-17T03:01:19.241Z
SHA-256 of the archived text
040374b1518f829cf089f8a6ad21fe80b5f6272bb13758284f487fee90f4d749
Stable URL of this page
https://metraipolis.com/documento/dc_2b45fa34b180

How to cite

An $m+n^{3/2}$ algorithm for counting spanning trees by $\ell_1$-regularized resistance — arXiv:2609.03574 — arXiv (en), https://arxiv.org/abs/2609.03574 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2b45fa34b180 (Metraipolis archive dc_2b45fa34b180, sha256 040374b1518f829cf089f8a6ad21fe80b5f6272bb13758284f487fee90f4d749)
BibTeX
@misc{dc2b45fa34b180,
  title = {An $m+n^3/2$ algorithm for counting spanning trees by $ell_1$-regularized resistance — arXiv:2609.03574},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.03574},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2b45fa34b180; sha256 040374b1518f829cf089f8a6ad21fe80b5f6272bb13758284f487fee90f4d749},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.03574. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

We study the basic problem of approximating the number of spanning trees of a graph. For a graph with $n$ vertices, $m$ edges, We propose an algorithm that approximates the number of spanning trees in $\widetilde O(m+n^{3/2}\eps^{-1})$ time. Our algorithm improves upon the previously best known $\widetilde O(m+n^{15/8}\eps^{-7/4})$ time algorithm by Chu, Gao, Peng, Sachdeva, Sawlani, and Wang [FOCS 2018] and the $\widetilde O(m^{3/2}\eps^{-1})$ time algorithm by Liu, Peng, and Yang [FOCS 2026]. Notably, our algorithm is based on the novel concept of $\ell_1$-regularized resistance. We propose simple and efficient algorithm for computing $\ell_1$-regularized resistance and we show that they can be used to approximate the number of spanning trees by combining with the determinant sparsifier framework of Durfee, Peebles, Peng, and Rao [FOCS 2017]. Our algorithm matches the best known size of the determinant sparsifiers.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-04 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2609.03574 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T02:39:14.120Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-04?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).