Article Contents
Article Contents

# Vertex control of flows in networks

• We study a transport equation in a network and control it in a single vertex. We describe all possible reachable states and prove a criterion of Kalman type for those vertices in which the problem is maximally controllable. The results are then applied to concrete networks to show the complexity of the problem.
Mathematics Subject Classification: 34B45, 93B05, 47N70.

 Citation: