Imagen de Portada

Diameter Shortcut Sets on Temporal Graphs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Quantmeyer, Gerome
Formato:	Preprint
Publicado:	2025
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

Better Diameter Bounds for Efficient Shortcuts and a Structural Criterion for Constructiveness
por: Haeupler, Bernhard, et al.
Publicado: (2026)

Closing the Gap Between Directed Hopsets and Shortcut Sets
por: Bernstein, Aaron, et al.
Publicado: (2022)

Diameter Computation on (Random) Geometric Graphs
por: Bläsius, Thomas, et al.
Publicado: (2026)

Reducing Shortcut and Hopset Constructions to Shallow Graphs
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Greedy Algorithms for Shortcut Sets and Hopsets
por: Bals, Ben, et al.
Publicado: (2025)

Combinatorial Maximum Flow via Weighted Push-Relabel on Shortcut Graphs
por: Bernstein, Aaron, et al.
Publicado: (2025)

Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter
por: Chalermsook, Parinya, et al.
Publicado: (2021)

Stronger Directed Low-Diameter Decompositions with Sub-Logarithmic Diameter and Separation
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Graph Spanners via Low-Diameter Router Decomposition
por: Chuzhoy, Julia, et al.
Publicado: (2026)

Tree-Like Shortcuttings of Trees
por: Le, Hung, et al.
Publicado: (2025)

Reviving Thorup's Shortcut Conjecture
por: Bernstein, Aaron, et al.
Publicado: (2025)

Shortcutting for Negative-Weight Shortest Path
por: Li, George Z., et al.
Publicado: (2025)

Shortcuts and Transitive-Closure Spanners Approximation
por: Chalermsook, Parinya, et al.
Publicado: (2025)

Going Beyond Surfaces in Diameter Approximation
por: Włodarczyk, Michał
Publicado: (2025)

Streaming Diameter of High-Dimensional Points
por: Halldórsson, Magnús M., et al.
Publicado: (2025)

Fault-Tolerant ST-Diameter Oracles
por: Bilò, Davide, et al.
Publicado: (2023)

Near-Optimal Directed Low-Diameter Decompositions
por: Bringmann, Karl, et al.
Publicado: (2025)

Simpler and Faster Directed Low-Diameter Decompositions
por: Li, Jason
Publicado: (2025)

An Optimal Algorithm for Cardinality-Constrained Diameter Partitioning
por: Xu, Chao, et al.
Publicado: (2026)

FPT approximations for Capacitated Sum of Radii and Diameters
por: Filtser, Arnold, et al.
Publicado: (2024)

New Diameter Approximations via Distance Oracle Techniques
por: Kirkpatrick, Yael, et al.
Publicado: (2026)

Log Diameter Rounds MST Verification and Sensitivity in MPC
por: Coy, Sam, et al.
Publicado: (2024)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
por: Li, Xizhe, et al.
Publicado: (2026)

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

Better Diameter Algorithms for Bounded VC-dimension Graphs and Geometric Intersection Graphs
por: Duraj, Lech, et al.
Publicado: (2023)

Dynamic Diameter in High-Dimensions against Adaptive Adversary and Beyond
por: Banihashem, Kiarash, et al.
Publicado: (2025)

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

Faster Negative-Weight Shortest Paths and Directed Low-Diameter Decompositions
por: Li, Jason, et al.
Publicado: (2025)

Approximation Algorithms for Clustering with Minimum Sum of Radii, Diameters, and Squared Radii
por: Friggstad, Zachary, et al.
Publicado: (2024)

Bounding Width on Graph Classes of Constant Diameter
por: Dabrowski, Konrad K., et al.
Publicado: (2025)

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

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

Exploring Word-Representable Temporal Graphs
por: Adamson, Duncan
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)

Computing Diameter +1 in Truly Subquadratic Time for Unit-Disk Graphs
por: Chang, Hsien-Chih, et al.
Publicado: (2024)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
por: Haeupler, Bernhard, et al.
Publicado: (2025)

A Branch-and-Bound Approach for Maximum Low-Diameter Dense Subgraph Problems
por: Zhou, Yi, et al.
Publicado: (2025)

The General Expiration Streaming Model: Diameter, $k$-Center, Counting, Sampling, and Friends
por: Blank, Lotte, et al.
Publicado: (2025)

Timeline Problems in Temporal Graphs: Vertex Cover vs. Dominating Set
por: Herrmann, Anton, et al.
Publicado: (2025)