Exploració per tema "Grafs, Teoria de -- Informàtica"

Ara es mostren els items 1-7 de 7

    • Locating domination in graphs and their complements 

      Hernando Martín, María del Carmen; Mora Giné, Mercè; Pelayo Melero, Ignacio Manuel (Universidad de Sevilla, 2013-10-16)
      Capítol de llibre
      Accés obert
      A dominating set S of a graph G is called locating-dominating , 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 ...

    • Non-linear graph-based codes for source coding 

      Matas Navarro, David; Lamarca Orozco, M. Meritxell; García Frías, Javier (2009)
      Text en actes de congrés
      Accés obert
      We introduce a new family of graph-based source codes that can be regarded as a nonlinear generalization of LDPC codes, and apply them to the compression of asymmetric binary memoryless sources. Simulation results and the ...

    • On large (delta, D, D, 1)-graphs 

      Gómez Martí, José; Fàbrega Canudas, José; Andrés Yebra, José Luis (2011-07)
      Article
      Accés restringit per política de l'editorial
      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 ...

    • Specification and Implementation of Aggregation in Graph Query Languages 

      Iglesias Sánchez, Patricia (Universitat Politècnica de Catalunya / Karlsruher Institut für Technology ., 2011-03)
      Projecte/Treball Final de Carrera
      Accés restringit per acord de confidencialitat

    • Study and Development of Hierarchical Path Finding to Speed Up Crowd Simulation 

      Fuentes Paredes, Carlos (Universitat Politècnica de Catalunya, 2014-11-27)
      Projecte Final de Màster Oficial
      Accés obert
      We propose a new hierarchical path finding solution for large environments. We use a navigation mesh as abstract data structure to partition the 3D world. Then, we build a hierarchy of graphs that allow us to perform faster ...

    • Theoretical aspects of graph models for MANETS 

      Díaz Cort, Josep; Dieter Wilhelm, Mitsche; Santi, Paolo (2010-03-01)
      Report de recerca
      Accés obert
      We survey the main theoretical aspects of models for Mobile Ad Hoc Networks (MANETs). We present theoretical characterizations of mobile network structural properties, di erent dynamic graph models of MANETs, and nally ...

    • Variants of unification considering compression and context variables 

      Gascón Caro, Adrià (Universitat Politècnica de Catalunya, 2014-05-30)
      Tesi
      Accés obert
      Term unification is a basic operation in several areas of computer science, specially in those related to logic. Generally speaking, it consists on solving equations over expressions called terms. Depending on the kind of ...