scientific article; zbMATH DE number 2086372

zbMath1054.68011MaRDI QIDQ4736826

Christian Scheideler

Publication date: 11 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2285/22850027.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items (15)

Traveling salesman problems in temporal graphs ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective ⋮ On temporal graph exploration ⋮ On Verifying and Maintaining Connectivity of Interval Temporal Networks ⋮ The complexity of optimal design of temporally connected graphs ⋮ Connectivity games over dynamic networks ⋮ Fault-tolerant graph realizations in the congested clique ⋮ Causality, influence, and computation in possibly disconnected synchronous dynamic networks ⋮ Temporal flows in temporal networks ⋮ How fast can we reach a target vertex in stochastic temporal graphs? ⋮ Temporal network optimization subject to connectivity constraints ⋮ Broadcasting in dynamic radio networks ⋮ How fast can we reach a target vertex in stochastic temporal graphs ⋮ Optimal algorithms for page migration in dynamic networks ⋮ An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: