Exploració per tema "bipartite graph"

Ara es mostren els items 1-4 de 4

    • An algorithm for incrementally enumerating bitriangles in large bipartite networks 

      Royo Sales, Juan Pablo (Universitat Politècnica de Catalunya, 2021-10)
      Projecte Final de Màster Oficial
      Accés obert
      Realitzat a/amb:   Leibniz Universität Hannover

    • LD-graphs and global location-domination in bipartite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014)
      Text en actes de congrés
      Accés obert
      A dominating setS of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S. Locating-dominating sets of minimum cardinality ...

    • LD-graphs and global location-domination in bipartite graphs 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2014-09-02)
      Article
      Accés restringit per política de l'editorial
      A dominating set S of a graph G is a locating-dominating-set, LD-set for short, if every vertex v not in S is uniquely determined by the set of neighbors of v belonging to S . Locating-dominating sets of minimum ...

    • Locating domination in bipartite graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (2017-11-03)
      Report de recerca
      Accés obert
      A set S of vertices of a graph G is distinguishing if the sets of neighbors in S for every pair of vertices not in S are distinct. A locating-dominating set of G is a dominating distinguishing set. The location-domination ...