Image de couverture de livre

Temporal queries for dynamic temporal forests

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Bilò, Davide, Gualà, Luciano, Leucci, Stefano, Proietti, Guido, Straziota, Alessandro
Format:	Preprint
Publié:	2024
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

Graph Spanners for Group Steiner Distances
par: Bilò, Davide, et autres
Publié: (2024)

Maintaining $k$-MinHash Signatures over Fully-Dynamic Data Streams with Recovery
par: Clementi, Andrea, et autres
Publié: (2024)

On the Inapproximability of Finding Minimum Monitoring Edge-Geodetic Sets
par: Bilò, Davide, et autres
Publié: (2024)

On the (In)Approximability of the Monitoring Edge Geodetic Set Problem
par: Bilò, Davide, et autres
Publié: (2025)

Approximate $2$-hop neighborhoods on incremental graphs: An efficient lazy approach
par: Becchetti, Luca, et autres
Publié: (2025)

A Tour of Locality Sensitive Filtering on the Sphere
par: Becchetti, Luca, et autres
Publié: (2026)

An Almost-Optimal Upper Bound on the Push Number of the Torus Puzzle
par: Caporrella, Matteo, et autres
Publié: (2026)

An Optimal Sorting Algorithm for Persistent Random Comparison Faults
par: Geissmann, Barbara, et autres
Publié: (2025)

Efficient Fault-Tolerant Search by Fast Indexing of Subnetworks
par: Bilò, Davide, et autres
Publié: (2024)

Simpler and Improved Replacement Path Coverings
par: Bilò, Davide, et autres
Publié: (2026)

Parallel batch queries on dynamic trees: algorithms and experiments
par: Ikram, Humza, et autres
Publié: (2025)

Improved Distance (Sensitivity) Oracles with Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2024)

Fault-Tolerant ST-Diameter Oracles
par: Bilò, Davide, et autres
Publié: (2023)

Approximate Distance Sensitivity Oracles in Subquadratic Space
par: Bilò, Davide, et autres
Publié: (2023)

Optimal prefix-suffix queries with applications
par: Pissis, Solon P.
Publié: (2024)

Trace reconstruction from local statistical queries
par: Chen, Xi, et autres
Publié: (2024)

On the cut-query complexity of approximating max-cut
par: Plevrakis, Orestis, et autres
Publié: (2022)

Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
par: Rucci, Davide
Publié: (2024)

Faster exact learning of k-term DNFs with membership and equivalence queries
par: Alman, Josh, et autres
Publié: (2025)

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

Finding the diameter of a tree with distance queries
par: Gerbner, Dániel, et autres
Publié: (2025)

Faster feasibility for dynamic flows and transshipments on temporal networks
par: Sheridan, Kristin, et autres
Publié: (2024)

Lower bounds for graph reconstruction with maximal independent set queries
par: Michel, Lukas, et autres
Publié: (2024)

Randomized query composition and product distributions
par: Sanyal, Swagato
Publié: (2024)

Sublinear-query relative-error testing of halfspaces
par: Chen, Xi, et autres
Publié: (2026)

On the query complexity of sampling from non-log-concave distributions
par: He, Yuchen, et autres
Publié: (2025)

Concurrent aggregate queries
par: Sela, Gal, et autres
Publié: (2024)

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

Conjugate queries can help
par: Tang, Ewin, et autres
Publié: (2025)

Fast decremental tree sums in forests
par: Berendsohn, Benjamin Aram, et autres
Publié: (2026)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
par: Cai, Xinwei, et autres
Publié: (2023)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
par: Heck, Sophia, et autres
Publié: (2026)

Quasi-linear distance query reconstruction for graphs of bounded treelength
par: Bastide, Paul, et autres
Publié: (2024)

A survey of BWT variants for string collections
par: Cenzato, Davide, et autres
Publié: (2022)

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

The Price of Universal Temporal Reachability
par: Bui-Xuan, Binh-Minh, et autres
Publié: (2026)

Minimum Temporal Spanners in Happy Graphs
par: Casteigts, Arnaud, et autres
Publié: (2026)

Exploration of Always $S$-Connected Temporal Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

Beer Path Problems in Temporal Graphs
par: D'Ascenzo, Andrea, et autres
Publié: (2025)

Diameter Shortcut Sets on Temporal Graphs
par: Quantmeyer, Gerome
Publié: (2025)