Saved in:
| Main Authors: | Adamson, Duncan, Spirakis, Paul G |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2602.19657 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Maintaining Bipartite Colourings on Temporal Graphs on a Budget
by: Adamson, Duncan, et al.
Published: (2025)
by: Adamson, Duncan, et al.
Published: (2025)
Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
Exploring Word-Representable Temporal Graphs
by: Adamson, Duncan
Published: (2025)
by: Adamson, Duncan
Published: (2025)
Exploring Temporal Graphs with Frequent and Regular Edges
by: Adamson, Duncan
Published: (2025)
by: Adamson, Duncan
Published: (2025)
Temporal Graph Reconfiguration for Always-Connected Graphs
by: Sievers, Paul, et al.
Published: (2025)
by: Sievers, Paul, et al.
Published: (2025)
Structural and Combinatorial Properties of 2-swap Word Permutation Graphs
by: Adamson, Duncan, et al.
Published: (2023)
by: Adamson, Duncan, et al.
Published: (2023)
Temporal Graph Realization With Bounded Stretch
by: Mertzios, George B., et al.
Published: (2025)
by: Mertzios, George B., et al.
Published: (2025)
The Complexity of Temporal Vertex Cover in Small-Degree Graphs
by: Hamm, Thekla, et al.
Published: (2022)
by: Hamm, Thekla, et al.
Published: (2022)
Enumerating m-Length Walks in Directed Graphs with Constant Delay
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
The Complexity of Transitively Orienting Temporal Graphs
by: Mertzios, George B., et al.
Published: (2021)
by: Mertzios, George B., et al.
Published: (2021)
New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
by: Heck, Sophia, et al.
Published: (2026)
by: Heck, Sophia, et al.
Published: (2026)
Realizing temporal transportation trees
by: Mertzios, George B., et al.
Published: (2024)
by: Mertzios, George B., et al.
Published: (2024)
Rollercoasters with Plateaus
by: Adamson, Duncan, et al.
Published: (2024)
by: Adamson, Duncan, et al.
Published: (2024)
Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous
by: Dogeas, Konstantinos, et al.
Published: (2023)
by: Dogeas, Konstantinos, et al.
Published: (2023)
Realization of Temporally Connected Graphs Based on Degree Sequences
by: Casteigts, Arnaud, et al.
Published: (2025)
by: Casteigts, Arnaud, et al.
Published: (2025)
Round-Delayed Amnesiac Flooding
by: Alafin, Oluwatobi, et al.
Published: (2026)
by: Alafin, Oluwatobi, et al.
Published: (2026)
Graph Exploration with Edge Weight Estimates
by: Gehnen, Matthias, et al.
Published: (2025)
by: Gehnen, Matthias, et al.
Published: (2025)
Connectivity Labeling in Faulty Colored Graphs
by: Petruschka, Asaf, et al.
Published: (2024)
by: Petruschka, Asaf, et al.
Published: (2024)
Dynamic Connectivity in Disk Graphs
by: Baumann, Alexander, et al.
Published: (2021)
by: Baumann, Alexander, et al.
Published: (2021)
Graph Exploration: The Impact of a Distance Constraint
by: Devismes, Stéphane, et al.
Published: (2024)
by: Devismes, Stéphane, et al.
Published: (2024)
Graph Reconstruction with a Connected Components Oracle
by: Harviainen, Juha, et al.
Published: (2025)
by: Harviainen, Juha, et al.
Published: (2025)
Connectivity-Preserving Minimum Separator in AT-free Graphs
by: Kenig, Batya
Published: (2025)
by: Kenig, Batya
Published: (2025)
Graph Traversal via Connected Mobile Agents
by: Jana, Saswata, et al.
Published: (2025)
by: Jana, Saswata, et al.
Published: (2025)
Approximation Schemes for Planar Graph Connectivity Problems
by: Neuwohner, Meike, et al.
Published: (2025)
by: Neuwohner, Meike, et al.
Published: (2025)
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
by: Cai, Xinwei, et al.
Published: (2023)
by: Cai, Xinwei, et al.
Published: (2023)
Rapid Exploration of Assembly Chemical Space of Molecular Graphs
by: Seet, Ian, et al.
Published: (2024)
by: Seet, Ian, et al.
Published: (2024)
$k$-Universality of Regular Languages Revisited
by: Adamson, Duncan, et al.
Published: (2025)
by: Adamson, Duncan, et al.
Published: (2025)
Creating Robust and Fair Graph Structures for Connectivity and Clustering
by: Chatterjee, Kushagra
Published: (2026)
by: Chatterjee, Kushagra
Published: (2026)
The Connected k-Vertex One-Center Problem on Graphs
by: Zhang, Jingru
Published: (2024)
by: Zhang, Jingru
Published: (2024)
(Sets of ) Complement Scattered Factors
by: Adamson, Duncan, et al.
Published: (2026)
by: Adamson, Duncan, et al.
Published: (2026)
Minimum Temporal Spanners in Happy Graphs
by: Casteigts, Arnaud, et al.
Published: (2026)
by: Casteigts, Arnaud, et al.
Published: (2026)
Beer Path Problems in Temporal Graphs
by: D'Ascenzo, Andrea, et al.
Published: (2025)
by: D'Ascenzo, Andrea, et al.
Published: (2025)
Diameter Shortcut Sets on Temporal Graphs
by: Quantmeyer, Gerome
Published: (2025)
by: Quantmeyer, Gerome
Published: (2025)
Parameterized Complexity of Temporal Connected Components: Treewidth and k-Path Graphs
by: Deligkas, Argyrios, et al.
Published: (2025)
by: Deligkas, Argyrios, et al.
Published: (2025)
Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
by: Fischer, Olivier, et al.
Published: (2025)
by: Fischer, Olivier, et al.
Published: (2025)
Optimizing Distances for Multi-Broadcast in Temporal Graphs
by: Carnevale, Daniele, et al.
Published: (2026)
by: Carnevale, Daniele, et al.
Published: (2026)
Approximating Optimal Labelings for Temporal Connectivity
by: Carnevale, Daniele, et al.
Published: (2025)
by: Carnevale, Daniele, et al.
Published: (2025)
Graph and String Parameters: Connections Between Pathwidth, Cutwidth and the Locality Number
by: Casel, Katrin, et al.
Published: (2019)
by: Casel, Katrin, et al.
Published: (2019)
TGLib: An Open-Source Library for Temporal Graph Analysis
by: Oettershagen, Lutz, et al.
Published: (2022)
by: Oettershagen, Lutz, et al.
Published: (2022)
Minimizing Reachability Times on Temporal Graphs via Shifting Labels
by: Deligkas, Argyrios, et al.
Published: (2021)
by: Deligkas, Argyrios, et al.
Published: (2021)
Similar Items
-
Maintaining Bipartite Colourings on Temporal Graphs on a Budget
by: Adamson, Duncan, et al.
Published: (2025) -
Collision-Free Robot Scheduling
by: Adamson, Duncan, et al.
Published: (2024) -
Exploring Word-Representable Temporal Graphs
by: Adamson, Duncan
Published: (2025) -
Exploring Temporal Graphs with Frequent and Regular Edges
by: Adamson, Duncan
Published: (2025) -
Temporal Graph Reconfiguration for Always-Connected Graphs
by: Sievers, Paul, et al.
Published: (2025)