Succinct data structure for path graphs
INFORMATION AND COMPUTATION(2024)
摘要
We consider the problem of designing a succinct data structure for path graphs , that generalizes interval graphs, on n vertices while efficiently supporting degree, adjacency, and neighbourhood queries. We provide the following two solutions for this problem:1. an n log n + o(n log n)-bit succinct data structure that supports adjacency query in O (log n) time, neighbourhood query in O (d log n) time and finally, degree query in min{ O (log2 n), O (d log n)} time where d is the degree of the queried vertex.2. an O (n log2 n)-bit space-efficient data structure that supports adjacency, neighborhood, and degree queries optimally.Central to our data structures is the usage of the heavy path decomposition, followed by careful bookkeeping using an orthogonal range search data structure using wavelet trees among others, which may be of independent interest for designing succinct data structures for other graph classes.(c) 2023 Elsevier Inc. All rights reserved.
更多查看译文
关键词
succinct data structure,space-efficient data structures,unlabelled path graphs,basic navigational queries,neighborhood query,n\log n,adjacency query,\log n,queried vertex,degree queries,d\log n,classical heavy path decomposition,orthogonal range search data structure
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要