Entropy-type conditions for Riemann solvers at nodes (Q536522)

This paper deals with scalar non linear conservation laws on networks represented by graphs, used in models of car or data traffic. A graph is defined by a finite collection of arcs connected together by vertices. To each arc is then associated a conservation law and a solution at each vertex is apropriatedly defined. In the paper, a single vertex is considered, composed of \(n\) incoming and \(m\) outgoing arcs and entropy conditions extending Kručkov definition are proposed and compared.