Exploració per autor "Martí Farré, Jaume"Més informacióMés informació

Ara es mostren els items 21-34 de 34

    • FONAMENTS DE LA MATEMÀTICA | FINAL 

      Martí Farré, Jaume (Universitat Politècnica de Catalunya, 2023-01-12)
      Examen
      Accés restringit a la comunitat UPC

    • FONAMENTS DE LA MATEMÀTICA | Final 

      Martí Farré, Jaume (Universitat Politècnica de Catalunya, 2020-01-13)
      Examen
      Accés restringit a la comunitat UPC

    • FONAMENTS DE LA MATEMÀTICA | Parcial 

      Martí Farré, Jaume (Universitat Politècnica de Catalunya, 2019-10-28)
      Examen
      Accés restringit a la comunitat UPC

    • Fonaments de la matemàtica. Resums, exercicis i problemes 

      Martí Farré, Jaume; Mora Giné, Mercè; Muñoz Lecanda, Miguel Carlos (Universitat Politècnica de Catalunya, 2014)
      Problema, exercici
      Accés obert

    • From clutters to matroids 

      Martí Farré, Jaume (2014-01-31)
      Article
      Accés obert

    • From clutters to matroids 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (Universidad de Sevilla, 2013)
      Text en actes de congrés
      Accés restringit per política de l'editorial
      This paper deals with the question of completing a monotone increasing family of subsets to obtain the dependent sets of a matroid. More precisely, we provide several natural ways of transforming the clutter of the inclusion ...

    • Immune sets in monotone infection rules: characterization and complexity 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (Elsevier, 2023-11-15)
      Article
      Accés obert
      Many dissemination processes in graphs can be described as follows at a basic level. At each step of the process, some vertices of the graph are coloured blue, and the remaining are coloured white, and a well-defined ...

    • Layer structure of De Bruijn and Kautz digraphs: an application to deflection routing 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (2016-10-17)
      Article
      Accés obert
      In the main part of this paper we present polynomial expressions for the cardinalities of some sets of interest of the nice distance-layer structure of the well-known De Bruijn and Kautz digraphs. More precisely, given a ...

    • Linearly dependent vectorial decomposition of clutters 

      Martí Farré, Jaume (2014)
      Text en actes de congrés
      Accés obert
      This paper deals with the question of completing a monotone increas- ing family of subsets G of a finite set ¿ to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ...

    • Linearly dependent vectorial decomposition of clutters 

      Martí Farré, Jaume (2014-09-16)
      Article
      Accés obert
      This paper deals with the question of completing a monotone increasing family of subsets of a finite set to obtain the linearly dependent subsets of a family of vectors of a vector space. Specifically, we demonstrate ...

    • On secret sharing schemes, matroids and polymatroids 

      Martí Farré, Jaume; Padró Laimon, Carles (2010-10)
      Article
      Accés restringit per política de l'editorial
      The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. The optimization of this parameter for general access structures is an important and ...

    • Transformation and decomposition of clutters into matroids 

      Martí Farré, Jaume; Mier Vinué, Anna de (2017-05-25)
      Article
      Accés obert
      A clutter is a family of mutually incomparable sets. The set of circuits of a matroid, its set of bases, and its set of hyperplanes are examples of clutters arising from matroids. In this paper we address the question of ...

    • Uniform clutters and dominating sets of graphs 

      Martí Farré, Jaume; Mora Giné, Mercè; Ruiz Muñoz, José Luis (2019-06-30)
      Article
      Accés obert
      A (simple) clutter is a family of pairwise incomparable subsets of a finite set . We say that a clutter is a domination clutter if there is at least a graph such that the collection of the inclusion-minimal dominating sets ...

    • Uniform forcing and immune sets in graphs and hypergraphs 

      Fàbrega Canudas, José; Martí Farré, Jaume; Muñoz López, Francisco Javier (2021-12-31)
      Article
      Accés obert
      Zero forcing is an iterative coloring process on a graph that has been widely used in such different areas as the modelling of propagation phenomena in networks and the study of minimum rank problems in matrices and graphs. ...