Edge exploration of temporal graphs

DOI10.1007/978-3-030-79987-8_8OpenAlexW3184510782MaRDI QIDQ5918622

Benjamin Merlin Bumpus, Kitty Meeks

Publication date: 22 March 2022

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2103.05387

zbMATH Keywords

fixed parameter tractabilitytemporal graphstemporal Eulerian circuittemporal exploration

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Discrete mathematics in relation to computer science (68Rxx)

Related Items (8)

Mengerian graphs: characterization and recognition ⋮ Untangling temporal graphs of bounded degree ⋮ Timeline cover in temporal graphs: exact and approximation algorithms ⋮ Eulerian walks in temporal graphs ⋮ Edge exploration of temporal graphs ⋮ On finding separators in temporal split and permutation graphs ⋮ Finding colorful paths in temporal graphs ⋮ Reducing reachability in temporal graphs: towards a more realistic model of real-world spreading processes

Cites Work

• Unnamed Item
• Temporal network optimization subject to connectivity constraints
• Finding temporal paths under waiting time constraints
• How fast can we reach a target vertex in stochastic temporal graphs?
• The complexity of optimal design of temporally connected graphs
• On temporal graph exploration
• Graph Theory
• Traveling Salesman Problems in Temporal Graphs
• On the Size and the Approximability of Minimum Temporally Connected Subgraphs
• As Time Goes By: Reflections on Treewidth for Temporal Graphs
• Parameterized Algorithms
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Connectivity and inference problems for temporal networks
• The temporal explorer who returns to the base

This page was built for publication: Edge exploration of temporal graphs