Now showing items 1-8 of 8

  • 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 ...
  • A mathematical model for dynamic memory networks 

    Fàbrega Canudas, José; Fiol Mora, Miquel Àngel; Serra Albó, Oriol; Andrés Yebra, José Luis (Iniciativa Digital Politècnica, 2011)
    Conference report
    Open Access
    The aim of this paper is to bring together the work done several years ago by M.A. Fiol and the other authors to formulate a quite general mathematical model for a kind of permutation networks known as dynamic memories. A ...
  • 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, ...
  • Modelización matemática 

    Andrés Yebra, José Luis (2014-01-10)
    Other
    Open Access
    La modelización matemática pretende describir la realidad en términos matemáticos, una tarea difícil y que, sin embargo,está jalonada de éxitos sorprendentes. El proceso de modelización matemática puede esquematizarse ...
  • On large (delta, D, D, 1)-graphs 

    Gómez Martí, José; Fàbrega Canudas, José; Andrés Yebra, José Luis (2011-07)
    Article
    Restricted access - publisher's policy
    Concern about fault tolerance in the design of interconnection networks has aroused interest in finding large graphs such that the subgraphs obtained by deleting any set of up to s vertices have small diameter. Clearly, 1 ...
  • 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 ...
  • The simulation course: an innovative way of teaching computational science in Aeronautics 

    González Cinca, Ricardo; Santamaria Barnadas, Eduard; Andrés Yebra, José Luis (Springer-Verlag, 2008-05)
    Conference report
    Open Access
    This article describes an innovative methodology for teach-ing an undergraduate course on Computational Science, with a particular emphasis in Computational Fluid Dynamics (CFD), and the experiences derived from its ...
  • When the arc-colored line digraph of a cayley colored digraph is again a cayley colored digraph 

    Fiol Mora, Maria Lluïsa; Fiol Mora, Miquel Àngel; Andrés Yebra, José Luis (1992-12)
    Article
    Open Access
    Let D6(G) be the Cayley colored ügraph of a finite group G generated by A. The arc-colored line digraph of a Cayley colored digraph ie obtained by appropriately coloring the arcs of its line digraph. In this paper it ...