Now showing items 1-3 of 3

  • A discrete optimization problem in local networks and data alignment 

    Fiol Mora, Miquel Àngel; Andrés Yebra, José Luis; Alegre de Miguel, Ignacio; Valero Cortés, Mateo (1987-06)
    Article
    Restricted access - publisher's policy
    This paper presents the solution of the following optimization problem that appears in the design of double-loop structures for local networks and also in data memory, allocation and data alignment in SIMD processors. Consider ...
  • Line digraph iterations and the (d,k) digraph problem 

    Fiol Mora, Miquel Àngel; Andrés Yebra, José Luis; Alegre de Miguel, Ignacio (1984-05)
    Article
    Restricted access - publisher's policy
    This paper studies the behavior of the diameter and the average distance between vertices of the line digraph of a given digraph. The results obtained are then applied to the so-called (d, k) digraph problem, that is, ...
  • The Diameter of undirected graphs associated to plane tessellations 

    Andrés Yebra, José Luis; Fiol Mora, Miquel Àngel; Morillo Bosch, M. Paz; Alegre de Miguel, Ignacio (1985)
    Article
    Open Access
    Thi s paper studi es the di ameter of sorne fami I i es of undirected graphs that can be associated to plane tessel lations which fu1 ly represent them. More precisely, we concentrate upon maximizing the order of the ...