Image de couverture de livre

Fast decremental tree sums in forests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Berendsohn, Benjamin Aram, Sokołowski, Marek
Format:	Preprint
Publié:	2026
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fast and simple unrooted dynamic forests
par: Berendsohn, Benjamin Aram
Publié: (2023)

Universally Optimal Decremental Tree Minima
par: Berendsohn, Benjamin Aram
Publié: (2026)

Permutation patterns in streams
par: Berendsohn, Benjamin Aram
Publié: (2025)

Optimal antimatroid sorting
par: Berendsohn, Benjamin Aram
Publié: (2025)

Optimization with pattern-avoiding input
par: Berendsohn, Benjamin Aram, et autres
Publié: (2023)

Balanced TSP partitioning
par: Berendsohn, Benjamin Aram, et autres
Publié: (2025)

Strongly Polynomial Parallel Work-Depth Tradeoffs for Directed SSSP
par: Karczmarz, Adam, et autres
Publié: (2025)

Fully dynamic biconnectivity in $\tilde{\mathcal{O}}(\log^2 n)$ time
par: Holm, Jacob, et autres
Publié: (2025)

Almost-linear time parameterized algorithm for rankwidth via dynamic rankwidth
par: Korhonen, Tuukka, et autres
Publié: (2024)

Subquadratic algorithms in minor-free digraphs: (weighted) distance oracles, decremental reachability, and more
par: Karczmarz, Adam, et autres
Publié: (2024)

Dynamic Detours
par: Dadush, Daniel, et autres
Publié: (2026)

Treedepth Inapproximability and Exponential ETH Lower Bound
par: Bonnet, Édouard, et autres
Publié: (2025)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
par: Borst, Sander, et autres
Publié: (2024)

Maintaining $\mathsf{CMSO}_2$ properties on dynamic structures with bounded feedback vertex number
par: Majewski, Konrad, et autres
Publié: (2021)

Polynomial-size encoding of all cuts of small value in integer-valued symmetric submodular functions
par: Oum, Sang-il, et autres
Publié: (2026)

A Refutation of Elmasry's $\tilde{O}(m \sqrt{n})$-Time Algorithm for Single-Source Shortest Paths
par: Atalig, Sunny, et autres
Publié: (2025)

Minimum sum vertex cover: kernelization and parameterized algorithms
par: Cao, Yixin, et autres
Publié: (2024)

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument
par: Majewski, Konrad, et autres
Publié: (2022)

Dynamic Parameterized Feedback Problems in Tournaments
par: Zych-Pawlewicz, Anna, et autres
Publié: (2024)

Theoretical insights and an experimental comparison of tango trees and multi-splay trees
par: Al-Adhami, Khaleel, et autres
Publié: (2024)

What Do Our Choices Say About Our Preferences?
par: Grining, Krzysztof, et autres
Publié: (2020)

Binary weights spanning trees and the $k$-red spanning tree problem in linear time
par: Hochbaum, Dorit S.
Publié: (2024)

Temporal queries for dynamic temporal forests
par: Bilò, Davide, et autres
Publié: (2024)

Nested and outlier embeddings into trees
par: Chawla, Shuchi, et autres
Publié: (2026)

Realizing temporal transportation trees
par: Mertzios, George B., et autres
Publié: (2024)

Fast Similarity Sketching
par: Dahlgaard, Søren, et autres
Publié: (2017)

Faster algorithms for packing forests in graphs and related problems
par: Arkhipov, Pavel, et autres
Publié: (2024)

Fast In-Spectrum Graph Watermarks
par: Bourrée, Jade Garcia, et autres
Publié: (2025)

Fast Approximate Counting of Cycles
par: Censor-Hillel, Keren, et autres
Publié: (2024)

Spanning tree congestion of proper interval graphs
par: Otachi, Yota
Publié: (2026)

Grandchildren-weight-balanced binary search trees
par: Jugé, Vincent
Publié: (2024)

Efficient top-down updates in AVL trees
par: Jugé, Vincent
Publié: (2024)

Optimal bounds on a tree inference algorithm
par: Gardiner, Jack, et autres
Publié: (2024)

Median and Small Parsimony Problems on RNA trees
par: Marchand, Bertrand, et autres
Publié: (2024)

Depth first representations of $k^2$-trees
par: Carmona, Gabriel, et autres
Publié: (2025)

Fast Sampling Based Sketches for Tensors
par: Swartworth, William, et autres
Publié: (2024)

Fast Pattern Matching with Epsilon Transitions
par: Cotumaccio, Nicola
Publié: (2025)

Fast and Small Subsampled R-indexes
par: Cobas, Dustin, et autres
Publié: (2024)

Fast Schulze Voting Using Quickselect
par: Arora, Arushi, et autres
Publié: (2024)

Composing dynamic programming tree-decomposition-based algorithms
par: Baste, Julien
Publié: (2019)