Edge exploration of temporal graphs (Q5918622): Difference between revisions

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