Compact I/O-Efficient Representation of Separable Graphs and Optimal Tree Layouts

Preprint English OPEN
Gavenčiak, Tomáš; Tětek, Jakub;
  • Subject: Computer Science - Data Structures and Algorithms

Compact and I/O-efficient data representations play an important role in efficient algorithm design, as memory bandwidth and latency can present a significant performance bottleneck, slowing the computation by orders of magnitude. While this problem is very well explore... View more
Share - Bookmark