Image de couverture de livre

Exploiting Automorphisms of Temporal Graphs for Fast Exploration and Rendezvous

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Dogeas, Konstantinos, Erlebach, Thomas, Kammer, Frank, Meintrup, Johannes, Moses Jr, William K.
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Succinct Planar Encoding with Minor Operations
par: Kammer, Frank, et autres
Publié: (2023)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
par: Hammer, Nina, et autres
Publié: (2022)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
par: Elberfeld, Michael, et autres
Publié: (2025)

Sorting and Ranking of Self-Delimiting Numbers with Applications to Outerplanar Graph Isomorphism
par: Kammer, Frank, et autres
Publié: (2020)

Scheduling with Obligatory Tests
par: Dogeas, Konstantinos, et autres
Publié: (2024)

Learning-Augmented Online Bipartite Matching in the Random Arrival Order Model
par: Burathep, Kunanon, et autres
Publié: (2025)

Space-Efficient Graph Kernelizations
par: Kammer, Frank, et autres
Publié: (2020)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
par: Bampis, Evripidis, et autres
Publié: (2024)

Minimizing Total Travel Time for Collaborative Package Delivery with Heterogeneous Drones
par: Erlebach, Thomas, et autres
Publié: (2026)

Revisiting a Successful Reduction Rule for Dominating Set
par: Geis, Lukas, et autres
Publié: (2025)

Exploration of Always $S$-Connected Temporal Graphs
par: Adamson, Duncan, et autres
Publié: (2026)

A faster algorithm for the construction of optimal factoring automata
par: Erlebach, Thomas, et autres
Publié: (2024)

Fast Marching based Rendezvous Path Planning for a Team of Heterogeneous Vehicle
par: Kim, Jaekwang, et autres
Publié: (2023)

Generating the Spanning Trees of Series-Parallel Graphs up to Graph Automorphism
par: Karamchedu, Mithra, et autres
Publié: (2025)

Graph Exploration with Edge Weight Estimates
par: Gehnen, Matthias, et autres
Publié: (2025)

Graph Exploration: The Impact of a Distance Constraint
par: Devismes, Stéphane, et autres
Publié: (2024)

Temporal Graph Reconfiguration for Always-Connected Graphs
par: Sievers, Paul, et autres
Publié: (2025)

Fast In-Spectrum Graph Watermarks
par: Bourrée, Jade Garcia, et autres
Publié: (2025)

Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
par: Cai, Xinwei, et autres
Publié: (2023)

Rapid Exploration of Assembly Chemical Space of Molecular Graphs
par: Seet, Ian, et autres
Publié: (2024)

New Approximations for Temporal Vertex Cover on Always Star Temporal Graphs
par: Heck, Sophia, et autres
Publié: (2026)

Minimum Temporal Spanners in Happy Graphs
par: Casteigts, Arnaud, et autres
Publié: (2026)

Beer Path Problems in Temporal Graphs
par: D'Ascenzo, Andrea, et autres
Publié: (2025)

Diameter Shortcut Sets on Temporal Graphs
par: Quantmeyer, Gerome
Publié: (2025)

Exploring Word-Representable Temporal Graphs
par: Adamson, Duncan
Publié: (2025)

Fast Algorithms for Graph Arboricity and Related Problems
par: Cen, Ruoxu, et autres
Publié: (2025)

Exploring Temporal Graphs with Frequent and Regular Edges
par: Adamson, Duncan
Publié: (2025)

Optimizing Distances for Multi-Broadcast in Temporal Graphs
par: Carnevale, Daniele, et autres
Publié: (2026)

Fast Sampling Based Sketches for Tensors
par: Swartworth, William, et autres
Publié: (2024)

TGLib: An Open-Source Library for Temporal Graph Analysis
par: Oettershagen, Lutz, et autres
Publié: (2022)

Maintaining Bipartite Colourings on Temporal Graphs on a Budget
par: Adamson, Duncan, et autres
Publié: (2025)

Realization of Temporally Connected Graphs Based on Degree Sequences
par: Casteigts, Arnaud, et autres
Publié: (2025)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
par: Li, Binhong, et autres
Publié: (2025)

Minimizing Reachability Times on Temporal Graphs via Shifting Labels
par: Deligkas, Argyrios, et autres
Publié: (2021)

Optimal Deterministic Rendezvous in Labeled Lines
par: Bourreau, Yann, et autres
Publié: (2025)

AGIS: Fast Approximate Graph Pattern Mining with Structure-Informed Sampling
par: Lee, Seoyong, et autres
Publié: (2026)

Forbidden Patterns in Temporal Graphs Resulting from Encounters in a Corridor
par: Csikós, Mónika, et autres
Publié: (2023)

New Algorithms for Incremental Minimum Spanning Trees and Temporal Graph Applications
par: Ding, Xiangyun, et autres
Publié: (2025)

Real-World Graph Analysis: Techniques for Static, Dynamic, and Temporal Communities
par: Rucci, Davide
Publié: (2024)

A Fast Approximation Algorithm for the Minimum Balanced Vertex Separator in a Graph
par: Kolmogorov, Vladimir, et autres
Publié: (2026)