scientific article; zbMATH DE number 7561634

DOI10.4230/LIPIcs.ICALP.2019.141MaRDI QIDQ5092344

Jakob T. Spooner, Frank Kammer, Andrej Sajenko, Kelin Luo, Erlebach, Thomas

Publication date: 21 July 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithmic graph theoryNP-complete problemtemporal graph exploration

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Related Items (9)

As Time Goes By: Reflections on Treewidth for Temporal Graphs ⋮ On temporal graph exploration ⋮ Non-strict Temporal Exploration ⋮ Multistage \(s-t\) path: confronting similarity with dissimilarity ⋮ Parameterised temporal exploration problems ⋮ Exploration of dynamic networks: tight bounds on the number of agents ⋮ Exploration of \(k\)-edge-deficient temporal graphs ⋮ Multistage s-t Path: Confronting Similarity with Dissimilarity in Temporal Graphs ⋮ Exploration of \(k\)-edge-deficient temporal graphs

Cites Work

• Unnamed Item
• Traveling salesman problems in temporal graphs
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring
• Online and offline algorithms for the time-dependent TSP with time zones
• The complexity of optimal design of temporally connected graphs
• On temporal graph exploration
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Temporal Vertex Cover with a Sliding Time Window
• The Complexity of Finding Small Separators in Temporal Graphs
• Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*
• Temporal graph classes: a view through temporal separators

This page was built for publication: