Now showing items 1-3 of 3

    • Presentation
      Icon

      Computing Optimal Shortcuts for Networks 

      Garijo Royo, Delia; Márquez Pérez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo I. (Dagsthul Publishing, 2018)
      We study augmenting a plane Euclidean network with a segment, called shortcut, to minimize the largest distance between ...
    • Article
      Icon

      Computing optimal shortcuts for networks 

      Garijo Royo, Delia; Márquez Pérez, Alberto; Rodríguez, Natalia; Silveira, Rodrigo I. (ELSEVIER SCIENCE BV; ELSEVIER, 2019)
      We study augmenting a plane Euclidean network with a segment, called a shortcut, to minimize the largest distance between ...
    • Article
      Icon

      Continuous mean distance of a weighted graph 

      Garijo Royo, Delia; Márquez Pérez, Alberto; Silveira, Rodrigo I. (Cornell University, 2021)
      We study the concept of the continuous mean distance of a weighted graph. For connected unweighted graphs, the mean ...