Imagen de Portada

The Price of Universal Temporal Reachability

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bui-Xuan, Binh-Minh, Nguyen, Nhat-Minh, Tixeuil, Sébastien, Yamauchi, Yukiko
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

On the power of standard DFS and BFS
por: Bui-Xuan, Binh-Minh, et al.
Publicado: (2026)

Distributed computation of temporal twins in periodic undirected time-varying graphs
por: Azerouk, Lina, et al.
Publicado: (2024)

Model checking with temporal graphs and their derivative
por: Bui-Xuan, Binh-Minh, et al.
Publicado: (2026)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
por: Csikós, Mónika, et al.
Publicado: (2023)

Maximizing Reachability via Shifting of Temporal Paths
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
por: Deligkas, Argyrios, et al.
Publicado: (2021)

Improved Online Reachability Preservers
por: Bodwin, Greg, et al.
Publicado: (2024)

Complexity Gaps between Point and Interval Temporal Graphs for some Reachability Problems
por: Aubian, Guillaume, et al.
Publicado: (2025)

Canadian Traveller Problems in Temporal Graphs
por: Bellitto, Thomas, et al.
Publicado: (2024)

Fast Answering Pattern-Constrained Reachability Queries with Two-Dimensional Reachability Index
por: Yang, Huihui, et al.
Publicado: (2025)

Polynomial Kernels with Reachability for Weighted $d$-Matroid Intersection
por: Huang, Chien-Chung, et al.
Publicado: (2026)

Fast and Simple Densest Subgraph with Predictions
por: Bui, Thai, et al.
Publicado: (2025)

Parallel Reachability and Shortest Paths on Non-sparse Digraphs: Near-linear Work and Sub-square-root Depth
por: Ashvinkumar, Vikrant, et al.
Publicado: (2026)

Disjoint Tours and the Price of Diversity
por: de Berg, Mark, et al.
Publicado: (2025)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
por: Bonomi, Silvia, et al.
Publicado: (2021)

Dynamic Pricing Algorithms for Online Set Cover
por: Bender, Max, et al.
Publicado: (2024)

A Note on Dynamic Bidirected Dyck-Reachability with Cycles
por: Zhang, Qirun
Publicado: (2024)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
por: Cai, Xinwei, et al.
Publicado: (2023)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
por: Heck, Sophia, et al.
Publicado: (2026)

Fair Minimum Labeling: Efficient Temporal Network Activations for Reachability and Equity
por: Oettershagen, Lutz, et al.
Publicado: (2025)

Minimum Temporal Spanners in Happy Graphs
por: Casteigts, Arnaud, et al.
Publicado: (2026)

Exploration of Always $S$-Connected Temporal Graphs
por: Adamson, Duncan, et al.
Publicado: (2026)

Beer Path Problems in Temporal Graphs
por: D'Ascenzo, Andrea, et al.
Publicado: (2025)

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

Diameter Shortcut Sets on Temporal Graphs
por: Quantmeyer, Gerome
Publicado: (2025)

Exploring Word-Representable Temporal Graphs
por: Adamson, Duncan
Publicado: (2025)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
por: Carnevale, Daniele, et al.
Publicado: (2026)

Exploring Temporal Graphs with Frequent and Regular Edges
por: Adamson, Duncan
Publicado: (2025)

Temporal Graph Reconfiguration for Always-Connected Graphs
por: Sievers, Paul, et al.
Publicado: (2025)

Dynamic Pricing for Reusable Resources: The Power of Two Prices
por: Balseiro, Santiago R., et al.
Publicado: (2023)

Temporal Routing in Static Networks: The Schedule Completion Problem
por: Döring, Michelle, et al.
Publicado: (2026)

TGLib: An Open-Source Library for Temporal Graph Analysis
por: Oettershagen, Lutz, et al.
Publicado: (2022)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
por: Adamson, Duncan, et al.
Publicado: (2025)

Realization of Temporally Connected Graphs Based on Degree Sequences
por: Casteigts, Arnaud, et al.
Publicado: (2025)

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

Prune, Don't Rebuild: Efficiently Tuning $α$-Reachable Graphs for Nearest Neighbor Search
por: Zhang, Tian, et al.
Publicado: (2026)

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems
por: Nguyen, Linh Anh
Publicado: (2024)

Approximate minimization of interpretations in fuzzy description logics under the Gödel semantics
por: Nguyen, Linh Anh
Publicado: (2025)

Testing Robustness of Temporal Transportation Networks via Interval Separators
por: Dondi, Riccardo, et al.
Publicado: (2026)

Solving Positive Linear Programs with Differential Privacy
por: Ene, Alina, et al.
Publicado: (2026)