Dynamic graph algorithms and data structures represent a vital research frontier in computer science, underpinning applications from network analysis to real-time system monitoring.

Daniel R. Jiang, Warren B. Powell, An Approximate Dynamic Programming Algorithm for Monotone Value Functions, Operations Research, Vol. 63, No. 6 (November-December 2015), pp. 1489-1511 ...

The background for this paper is a dynamic programming model with a Borel state space and compact action sets. A new simple proof of the compactness of a space of measures corresponding to randomized ...

Research team led by Chuliang Weng introduces D2-GCN, a groundbreaking disentangled graph convolutional network that dynamically adjusts feature channels for enhanced node representation ...

Covers the fundamentals of algorithms and various algorithmic strategies, including time and space complexity, sorting algorithms, recurrence relations, divide and conquer algorithms, greedy ...

Dynamic Programming and Optimal Control Dynamic Programming and Optimal Control is offered within DMAVT and attracts in excess of 300 students per year from a wide variety of disciplines. It is an ...

This course examines such topics as greedy algorithms, dynamic programming, graph algorithms, string processing, and algorithms for computational geometry. We will discuss how to use these techniques ...