Low time complexity algorithms for path computation in Cayley Graphs 

    Aguirre Guerrero, Daniela; Ducoffe, Guillaume; Fàbrega i Soler, Lluís; Vilà Talleda, Pere; Coudert, David (2019-04-30)

    We study the problem of path computation in Cayley Graphs (CG) from an approach of word processing in groups. This approach consists in encoding the topological structure of CG in an automaton called Diff, then techniques ...

    Optimal selection of monitoring sites in cities for SARS-CoV-2 surveillance in sewage networks 

    Calle Ortega, Eusebi; Martínez Álvarez, David; Brugués-i-Pujolràs, Roser; Farreras Casamort, Miquel; Saló Grau, Joan; Pueyo-Ros, Josep; Corominas Tabares, Lluís (2021-12-01)

    Selecting sampling points to monitor traces of SARS-CoV-2 in sewage at the intra-urban scale is no trivial task given the complexity of the networks and the multiple technical, economic and socio-environmental constraints ...