Cover Image

Fast and simple unrooted dynamic forests

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Berendsohn, Benjamin Aram
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast decremental tree sums in forests
by: Berendsohn, Benjamin Aram, et al.
Published: (2026)

Permutation patterns in streams
by: Berendsohn, Benjamin Aram
Published: (2025)

Universally Optimal Decremental Tree Minima
by: Berendsohn, Benjamin Aram
Published: (2026)

Optimal antimatroid sorting
by: Berendsohn, Benjamin Aram
Published: (2025)

Optimization with pattern-avoiding input
by: Berendsohn, Benjamin Aram, et al.
Published: (2023)

Balanced TSP partitioning
by: Berendsohn, Benjamin Aram, et al.
Published: (2025)

A branch-&-price approach to the unrooted maximum agreement forest problem
by: Frohn, Martin, et al.
Published: (2024)

Temporal queries for dynamic temporal forests
by: Bilò, Davide, et al.
Published: (2024)

New simple and fast quicksort algorithm for equal keys
by: Afereidoon, Parviz
Published: (2025)

A simple $(2+ε)$-approximation for knapsack interdiction
by: Weninger, Noah
Published: (2026)

Dynamic framework for edge-connectivity maintenance of simple graphs
by: Wrobel, Blazej
Published: (2026)

A simple and efficient preprocessing step for convex hull problem
by: Heydari, Mohammad, et al.
Published: (2023)

Fast Similarity Sketching
by: Dahlgaard, Søren, et al.
Published: (2017)

A simple algorithm for Combinatorial n-fold ILPs using the Steinitz Lemma
by: Gupta, Sushmita, et al.
Published: (2025)

A simple linear-time algorithm for generating auxiliary 3-edge-connected subgraphs
by: Tsin, Yung H.
Published: (2023)

Faster algorithms for packing forests in graphs and related problems
by: Arkhipov, Pavel, et al.
Published: (2024)

Fast In-Spectrum Graph Watermarks
by: Bourrée, Jade Garcia, et al.
Published: (2025)

Fast Approximate Counting of Cycles
by: Censor-Hillel, Keren, et al.
Published: (2024)

Fast Sampling Based Sketches for Tensors
by: Swartworth, William, et al.
Published: (2024)

Fast Pattern Matching with Epsilon Transitions
by: Cotumaccio, Nicola
Published: (2025)

Fast and Small Subsampled R-indexes
by: Cobas, Dustin, et al.
Published: (2024)

Fast Schulze Voting Using Quickselect
by: Arora, Arushi, et al.
Published: (2024)

A simple deterministic near-linear time approximation scheme for transshipment with arbitrary positive edge costs
by: Fox, Emily
Published: (2023)

Provably Fast and Space-Efficient Parallel Biconnectivity
by: Dong, Xiaojun, et al.
Published: (2023)

Fast Practical Compression of Deterministic Finite Automata
by: Bille, Philip, et al.
Published: (2023)

Noisy (Binary) Searching: Simple, Fast and Correct
by: Dereniowski, Dariusz, et al.
Published: (2021)

Fast and Practical Single-Exponential Algorithms for Branchwidth
by: Kaneda, Taiki, et al.
Published: (2026)

Fast Algorithms for Graph Arboricity and Related Problems
by: Cen, Ruoxu, et al.
Published: (2025)

Fast and Compact Sketch-Based Dynamic Connectivity
by: De Man, Quinten, et al.
Published: (2025)

A Simple and Fast Algorithm for Fair Cuts
by: Li, Jason, et al.
Published: (2024)

Approximating maximum properly colored forests via degree bounded independent sets
by: Bai, Yuhang, et al.
Published: (2025)

Stronger adversaries grow cheaper forests: online node-weighted Steiner problems
by: Borst, Sander, et al.
Published: (2024)

Fast and simple multiplication of bounded twin-width matrices
by: Kozma, László, et al.
Published: (2026)

Fast Parallel Algorithms for Submodular $p$-Superseparable Maximization
by: Cervenjak, Philip, et al.
Published: (2023)

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
by: Dogeas, Konstantinos, et al.
Published: (2023)

Fast exact algorithms via the Matrix Tree Theorem
by: Arvind, V., et al.
Published: (2025)

Designing Compact ILPs via Fast Witness Verification
by: Włodarczyk, Michał
Published: (2025)

Fast and Memory Efficient Multimodal Journey Planning with Delays
by: Katkalo, Denys, et al.
Published: (2026)

Fast $k$-means Seeding Under The Manifold Hypothesis
by: Shah, Poojan, et al.
Published: (2026)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
by: Bilò, Davide, et al.
Published: (2024)