Exploració per tema "Minimum spanning tree"

Ara es mostren els items 1-3 de 3

    • Colored spanning graphs for set visualization 

      Hurtado Díaz, Fernando Alfredo; Korman, Matias; Van Kreveld, Matias; Löffler, Maarten; Sacristán Adinolfi, Vera; Shioura, Akiyoshi; Silveira, Rodrigo Ignacio; Speckmann, Bettina; Tokuyama, Takeshi (2018-03)
      Article
      Accés obert
      We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple. Blue points belong exclusively to the ...

    • Minimizing interference in ad hoc networks with bounded communication radius 

      Korman Cozzetti, Matías (2012-10-15)
      Article
      Accés restringit per política de l'editorial
      We consider a topology control problem in which we are given a set of sensors in RdRd and we would like to assign a communication radius to each of them so that they generate a connected network and have low receiver-based ...

    • Paths and compatible hamiltonian cycles 

      Porta Regué, Oriol (Universitat Politècnica de Catalunya, 2017-09)
      Treball Final de Grau
      Accés obert
      Aquest projecte està centrat en estudiar condicions que fan que un conjunt de punts tinguin un camí d'expansió que sigui compatible amb un cicle Hamiltonià. Hem demostrat que ser un camí monòton o self-approaching és ...