Imagen de Portada

Reconstructing Bounded Treelength Graphs with Linearithmic Shortest Path Distance Queries

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kaudan, Chirag, Nayyeri, Amir
Formato:	Preprint
Publicado:	2026
Materias:	Data Structures and Algorithms G.2.2
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Simpler and Unified Recognition Algorithm for Path Graphs and Directed Path Graphs
por: Balzotti, Lorenzo
Publicado: (2020)

Label Correcting Algorithms for the Multiobjective Temporal Shortest Path Problem
por: Marica, Edina, et al.
Publicado: (2026)

Arborescences and Shortest Path Trees when Colors Matter
por: Ardra, P. S., et al.
Publicado: (2024)

Approximation Algorithms for Action-Reward Query-Commit Matching
por: Derakhshan, Mahsa, et al.
Publicado: (2026)

Tight Approximation Bounds on a Simple Algorithm for Minimum Average Search Time in Trees
por: Høgemo, Svein
Publicado: (2024)

A Faster Directed Single-Source Shortest Path Algorithm
por: Duan, Ran, et al.
Publicado: (2026)

Breaking the Sorting Barrier for Directed Single-Source Shortest Paths
por: Duan, Ran, et al.
Publicado: (2025)

Speeding-up Graph Algorithms via Clique Partitioning
por: Chavan, Akshar, et al.
Publicado: (2025)

Graph Threading
por: Demaine, Erik D., et al.
Publicado: (2023)

Approximating the Average-Case Graph Search Problem with Non-Uniform Costs
por: Szyfelbein, Michał
Publicado: (2025)

Near-Linear Time Computation of Welzl Orders on Graphs with Linear Neighborhood Complexity
por: Dreier, Jan, et al.
Publicado: (2026)

Single-Source Shortest Paths and Almost Exact Diameter in Pseudodisk Graphs
por: de Berg, Mark, et al.
Publicado: (2026)

On the Parameterized Tractability of Packing Vertex-Disjoint A-Paths with Length Constraints
por: Bandopadhyay, Susobhan, et al.
Publicado: (2026)

The planar edge-coloring theorem of Vizing in $O(n\log n)$ time
por: Jędrzejczak, Patryk, et al.
Publicado: (2025)

Engineering Algorithms for $\ell$-Isolated Maximal Clique Enumeration
por: D'Elia, Marco, et al.
Publicado: (2025)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
por: Bampis, Evripidis, et al.
Publicado: (2024)

Balanced Substructures in Bicolored Graphs
por: Ardra, P. S., et al.
Publicado: (2024)

Graph Threading with Turn Costs
por: Demaine, Erik D., et al.
Publicado: (2024)

Structural Parameterization of Steiner Tree Packing
por: Hastrich, Niko, et al.
Publicado: (2025)

Fast and Simple Sorting Using Partial Information
por: Haeupler, Bernhard, et al.
Publicado: (2024)

JFR: An Efficient Jump Frontier Relaxation Strategy for Bellman-Ford
por: Wang, Xin, et al.
Publicado: (2025)

Customizable Contraction Hierarchies -- A Survey
por: Bläsius, Thomas, et al.
Publicado: (2025)

Low-degree spanning trees of $2$-edge-connected graphs in linear time
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

Maintaining Routing Structures under Deletions via Self-Pruning
por: Haeupler, Bernhard, et al.
Publicado: (2025)

Universal Optimality of Dijkstra via Beyond-Worst-Case Heaps
por: Haeupler, Bernhard, et al.
Publicado: (2023)

Bidirectional Dijkstra's Algorithm is Instance-Optimal
por: Haeupler, Bernhard, et al.
Publicado: (2024)

Faster shortest-path algorithms using the acyclic-connected tree
por: Stefansson, Elis, et al.
Publicado: (2025)

Lower Bounds for Leaf Rank of Leaf Powers
por: Høgemo, Svein
Publicado: (2024)

An O(log n)-Approximation Algorithm for (p,q)-Flexible Graph Connectivity via Independent Rounding
por: Ibrahimpur, Sharat, et al.
Publicado: (2025)

Splittable Spanning Trees and Balanced Forests in Dense Random Graphs
por: Gillman, David, et al.
Publicado: (2025)

Better coloring of 3-colorable graphs
por: Kawarabayashi, Ken-ichi, et al.
Publicado: (2024)

NP-Completeness of the Combinatorial Distance Matrix Realisation Problem
por: Fairbairn, David L., et al.
Publicado: (2024)

Backdoors for Quantified Boolean Formulas
por: Eriksson, Leif, et al.
Publicado: (2026)

Tight Guarantees for Cut-Relative Survivable Network Design via a Decomposition Technique
por: Kumar, Nikhil, et al.
Publicado: (2025)

Almost Tight Additive Guarantees for $k$-Edge-Connectivity
por: Kumar, Nikhil, et al.
Publicado: (2025)

Towards a Parameterized Approximation Dichotomy of MinCSP for Linear Equations over Finite Commutative Rings
por: Dabrowski, Konrad K., et al.
Publicado: (2024)

Finding All Bounded-Length Simple Cycles in a Directed Graph -- Revisited
por: Bauernöppel, Frank, et al.
Publicado: (2025)

On (Random-order) Online Contention Resolution Schemes for the Matching Polytope of (Bipartite) Graphs
por: MacRury, Calum, et al.
Publicado: (2022)

Graphs with no long claws: An improved bound for the analog of the Gyárfás' path argument
por: Bourneuf, Romain, et al.
Publicado: (2025)

Bipartite Matching with Pair-Dependent Bounds
por: Rosner, Shaul, et al.
Publicado: (2025)