Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs (Q2947012): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Characterizing Topological Assumptions of Distributed Algorithms in Dynamic Networks / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3992991 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4023519 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distributed computation in dynamic networks / rank | |||
Normal rank | |||
Latest revision as of 18:36, 10 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs |
scientific article |
Statements
Efficiently Testing $$T$$-Interval Connectivity in Dynamic Graphs (English)
0 references
21 September 2015
0 references
\(T\)-interval connectivity
0 references
dynamic graphs
0 references
time-varying graphs
0 references
