Imagen de Portada

Minimizing Reachability Times on Temporal Graphs via Shifting Labels

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Deligkas, Argyrios, Eiben, Eduard, Skretas, George
Formato:	Preprint
Publicado:	2021
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

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

Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Individual Rationality in Topological Distance Games is Surprisingly Hard
por: Deligkas, Argyrios, et al.
Publicado: (2024)

Coordinated Motion Planning is FPT on Discretized Simple Polygons
por: Deligkas, Argyrios, et al.
Publicado: (2026)

EF1 and EFX Orientations
por: Deligkas, Argyrios, et al.
Publicado: (2024)

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

The Complexity of Extending Fair Allocations of Indivisible Goods
por: Deligkas, Argyrios, et al.
Publicado: (2025)

Determinantal Sieving
por: Eiben, Eduard, et al.
Publicado: (2023)

FPT algorithms over linear delta-matroids with applications
por: Eiben, Eduard, et al.
Publicado: (2025)

Polynomial Kernel and Incompressibility for Prison-Free Edge Deletion and Completion
por: Houari-Durand, Séhane Bel, et al.
Publicado: (2025)

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

The Price of Universal Temporal Reachability
por: Bui-Xuan, Binh-Minh, et al.
Publicado: (2026)

FO and MSO Model Checking on Temporal Graphs
por: Döring, Michelle, et al.
Publicado: (2026)

From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
por: Eiben, Eduard, et al.
Publicado: (2024)

Hyperbolic Random Graphs: Clique Number and Degeneracy with Implications for Colouring
por: Baguley, Samuel, et al.
Publicado: (2024)

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

Dynamic Network Discovery via Infection Tracing
por: Bals, Ben, et al.
Publicado: (2024)

Counting and Sampling Labeled Chordal Graphs in Polynomial Time
por: Hebert-Johnson, Ursula, et al.
Publicado: (2023)

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

Public Goods Games in Directed Networks with Constraints on Sharing
por: Deligkas, Argyrios, et al.
Publicado: (2025)

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

Catch Me If You Can: Finding the Source of Infections in Temporal Networks
por: Bals, Ben, et al.
Publicado: (2024)

Minimizing Makespan in Sublinear Time via Weighted Random Sampling
por: Fu, Bin, et al.
Publicado: (2026)

Bellman-Ford in Almost-Linear Time for Dense Graphs
por: Li, George Z., et al.
Publicado: (2026)

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

Minimizing the Minimizers via Alphabet Reordering
por: Verbeek, Hilde, et al.
Publicado: (2024)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
por: Chen, Qingyun, et al.
Publicado: (2024)

Connectivity Labeling in Faulty Colored Graphs
por: Petruschka, Asaf, et al.
Publicado: (2024)

Optimal Distance Labeling for Permutation Graphs
por: Gawrychowski, Paweł, et al.
Publicado: (2024)

Õptimal Fault-Tolerant Labeling for Reachability and Approximate Distances in Directed Planar Graphs
por: Boneh, Itai, et al.
Publicado: (2025)

On Fixed-Parameter Tractability of Weighted 0-1 Timed Matching Problem on Temporal Graphs
por: Kumar, Rinku, et al.
Publicado: (2025)

Computing the LCP Array of a Labeled Graph
por: Alanko, Jarno, et al.
Publicado: (2024)

Discrepancy Minimization in Input-Sparsity Time
por: Deng, Yichuan, et al.
Publicado: (2022)

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)

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

Path-Reporting Distance Oracles for Vertex-Labeled Graphs
por: Neiman, Ofer, et al.
Publicado: (2026)

Algorithms for Optimally Shifting Intervals under Intersection Graph Models
por: Honorato-Droguett, Nicolás, et al.
Publicado: (2023)

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

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