Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs (Q2947012): Difference between revisions

@@ Property / author @@
-Arnaud Casteigts
@@ Property / author: Arnaud Casteigts / rank @@
-Normal rank
@@ Property / author @@
+Arnaud Casteigts
@@ Property / author: Arnaud Casteigts / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W1861651162
@@ Property / OpenAlex ID: W1861651162 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.00089
@@ Property / arXiv ID: 1502.00089 / rank @@
+Normal rank
@@ Property / cites work @@
+COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
+Normal rank
@@ Property / cites work @@
+Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks
+Normal rank
@@ Property / cites work @@
+Q3992991
@@ Property / cites work: Q3992991 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4023519
@@ Property / cites work: Q4023519 / rank @@
+Normal rank
@@ Property / cites work @@
+Distributed computation in dynamic networks
@@ Property / cites work: Distributed computation in dynamic networks / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2947012