An explicit finite volume algorithm for vanishing viscosity solutions on a network

In [Andreianov, Coclite, Donadello, Discrete Contin. Dyn. Syst. A, 2017], a finite volume scheme was introduced for computing vanishing viscosity solutions on a single-junction network, and convergence to the vanishing viscosity solution was proven. This problem models $m$ incoming and $n$ outgoing roads that meet at a single junction. On each road the vehicle density evolves according to a scalar conservation law, and the requirements for joining the solutions at the junction are defined via the so-called vanishing viscosity germ. The algorithm mentioned above processes the junction in an implicit manner. We propose an explicit version of the algorithm. It differs only in the way that the junction is processed. We prove that the approximations converge to the unique entropy solution of the associated Cauchy problem.