Marina Girolimetto

According to our database, Marina Girolimetto authored at least 3 papers between 2016 and 2018.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2018

Exploiting the diversity of shortest pairs of edge-disjoint paths.

Marina Girolimetto, Rodrigo Stange Tessinari, Fabio O. Lima, Claunir Pavan, Marcia H. M. Paiva

Proceedings of the XXXVI Brazilian Symposium on Computer Networks and Distributed Systems, 2018

2017

Two Deterministic Strategies for Finding Shortest Pairs of Edge-disjoint Paths.

Marina Girolimetto, Marcia Helena Moreira Paiva, Claunir Pavan, Fabio O. Lima, Rodrigo Stange Tessinari

Proceedings of the 3rd Spring School on Networks co-located with (ChileCON 2017), 2017

2016

The Average Number of Hops for Working and Backup Paths in Telecommunication Networks.

Marina Girolimetto, Claunir Pavan

Proceedings of the II Spring School on Networks 2016, 2016