Using compressed suffix-arrays for a compact representation of temporal-graphs

DOI10.1016/j.ins.2018.07.023zbMath1441.68025arXiv1812.11244OpenAlexW2870808032WikidataQ129527930 ScholiaQ129527930MaRDI QIDQ2200556

Diego Caro, Antonio Fariña, M. Andrea Rodriguez, Nieves R. Brisaboa

Publication date: 22 September 2020

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1812.11244

zbMATH Keywords

self-indextemporal graphscompressed suffix array

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)

Uses Software

• Pregel

Cites Work

• Unnamed Item
• Wavelet trees for all
• Foundations of multidimensional and metric data structures.
• Compressed representations of sequences and full-text indexes
• Statistical mechanics of complex networks
• Suffix Arrays: A New Method for On-Line String Searches
• Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
• New text indexing functionalities of the compressed suffix arrays
• Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
• A Method for the Construction of Minimum-Redundancy Codes
• COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS
• Windows into Relational Events: Data Structures for Contiguous Subsequences of Edges
• An Introduction to Temporal Graphs: An Algorithmic Perspective^*

This page was built for publication: Using compressed suffix-arrays for a compact representation of temporal-graphs