ListarLaboratorio de Bases de Datos (LBD) por tema "Graph compression"

Mostrando ítems 1-2 de 2

    • Exploiting Computation-Friendly Graph Compression Methods for Adjacency-Matrix Multiplication 

      Francisco, Alexandre P.; Gagie, Travis; Ladra, Susana; Navarro, Gonzalo (IEEE Computer Society, 2018-03)
      [Abstract] Computing the product of the (binary) adjacency matrix of a large graph with a real-valued vector is an important operation that lies at the heart of various graph analysis tasks, such as computing PageRank. In ...

    • Two-Dimensional Block Trees 

      Brisaboa, Nieves R.; Gagie, Travis; Gómez-Brandón, Adrián; Navarro, Gonzalo (Oxford University Press, 2024-01)
      [Absctract]: The Block Tree is a data structure for representing repetitive sequences in compressed space, which reaches space comparable with that of Lempel–Ziv compression while retaining fast direct access to any position ...