Exploration of \(k\)-edge-deficient temporal graphs (Q5918789): Difference between revisions

@@ Property / DOI @@
-.1007/s00236-022-00421-5
@@ Property / DOI: 10.1007/s00236-022-00421-5 / rank @@
-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 exploring always-connected temporal graphs of small pathwidth
+Normal rank
@@ Property / cites work @@
+Online and offline algorithms for the time-dependent TSP with time zones
+Normal rank
@@ Property / cites work @@
+COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
+Normal rank
@@ Property / cites work @@
+On temporal graph exploration
@@ Property / cites work: On temporal graph exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Q5092344
@@ Property / cites work: Q5092344 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5005137
@@ Property / cites work: Q5005137 / rank @@
+Normal rank
@@ Property / cites work @@
+Non-strict Temporal Exploration
@@ Property / cites work: Non-strict Temporal Exploration / rank @@
+Normal rank
@@ Property / cites work @@
+Exploration of \(k\)-edge-deficient temporal graphs
+Normal rank
@@ Property / cites work @@
+Covering Graphs by Cycles
@@ Property / cites work: Covering Graphs by Cycles / rank @@
+Normal rank
@@ Property / cites work @@
+Finding kth paths and p-centers by generating and searching good data structures
+Normal rank
@@ Property / cites work @@
+Q5344766
@@ Property / cites work: Q5344766 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds on distributed exploration of temporal graphs
+Normal rank
@@ Property / cites work @@
+Exploration of dynamic tori by multiple agents
@@ Property / cites work: Exploration of dynamic tori by multiple agents / rank @@
+Normal rank
@@ Property / cites work @@
+Q5555548
@@ Property / cites work: Q5555548 / rank @@
+Normal rank
@@ Property / cites work @@
+Exploration of Constantly Connected Dynamic Graphs Based on Cactuses
+Normal rank
@@ Property / cites work @@
+Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring
+Normal rank
@@ Property / cites work @@
+Connectivity and inference problems for temporal networks
+Normal rank
@@ Property / cites work @@
+An Introduction to Temporal Graphs: An Algorithmic Perspective
+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 @@
+A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
+Normal rank
@@ Property / cites work @@
+Q4324425
@@ Property / cites work: Q4324425 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of finding small separators in temporal graphs
+Normal rank
@@ Property / DOI @@
+.1007/S00236-022-00421-5
@@ Property / DOI: 10.1007/S00236-022-00421-5 / rank @@
+Normal rank