Pages that link to "Item:Q897391"

The following pages link to Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391):

Displaying 14 items.

• Traveling salesman problems in temporal graphs (Q284573) (← links)
• The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
• Connectivity preserving network transformers (Q529024) (← links)
• Exploration of the \(T\)-interval-connected dynamic graphs: the case of the ring (Q722206) (← links)
• Temporal network optimization subject to connectivity constraints (Q1739101) (← links)
• A faster exact-counting protocol for anonymous dynamic networks (Q1755728) (← links)
• On the expressivity of time-varying graphs (Q2348032) (← links)
• The complexity of optimal design of temporally connected graphs (Q2408566) (← links)
• A Glimpse at Paul G. Spirakis (Q3464465) (← links)
• An Introduction to Temporal Graphs: An Algorithmic Perspective (Q3464477) (← links)
• Beyond Rings: Gathering in 1-Interval Connected Graphs (Q5087065) (← links)
• On Verifying and Maintaining Connectivity of Interval Temporal Networks (Q5087856) (← links)
• Non-strict Temporal Exploration (Q5100955) (← links)
• An Introduction to Temporal Graphs: An Algorithmic Perspective^* (Q5856438) (← links)