Succinct data structures for nearest colored node in a tree

被引：0
|
作者：
Tsur, Dekel [1 ]
机构：
[1] Ben Gurion Univ Negev, Dept Comp Sci, Beer Sheva, Israel
来源：
INFORMATION PROCESSING LETTERS | 2018年 / 132卷
关键词：
Succinct data structures; Labeled trees; Colored trees;
D O I：
10.1016/j.ipl.2017.10.001
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color alpha, the structures find the nearest node to x with color alpha. Our results improve the O(n log n)-bits structure of Gawrychowski et al. (2016) [12]. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码：6 / 10
页数：5
相关论文
共 50 条
  • [41] Compact and succinct data structures for multidimensional orthogonal range searching *
    Ishiyama, Kazuki
    Sadakane, Kunihiko
    [J]. INFORMATION AND COMPUTATION, 2020, 273
  • [42] From Theory to Practice: Plug and Play with Succinct Data Structures
    Gog, Simon
    Beller, Timo
    Moffat, Alistair
    Petri, Matthias
    [J]. EXPERIMENTAL ALGORITHMS, SEA 2014, 2014, 8504 : 326 - 337
  • [43] BIT-PROBE LOWER BOUNDS FOR SUCCINCT DATA STRUCTURES
    Viola, Emanuele
    [J]. SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1593 - 1604
  • [44] Succinct data structures for bounded clique-width graphs
    Chakraborty, Sankardeep
    Jo, Seungbum
    Sadakane, Kunihiko
    Satti, Srinivasa Rao
    [J]. DISCRETE APPLIED MATHEMATICS, 2024, 352 : 55 - 68
  • [45] Succinct Data Structures for Path Graphs and Chordal Graphs Revisited
    He, Meng
    Munro, J. Ian
    Wu, Kaiyu
    [J]. 2024 DATA COMPRESSION CONFERENCE, DCC, 2024, : 492 - 501
  • [46] In-memory Representations of Databases via Succinct Data Structures
    Raman, Rajeev
    [J]. PODS'18: PROCEEDINGS OF THE 37TH ACM SIGMOD-SIGACT-SIGAI SYMPOSIUM ON PRINCIPLES OF DATABASE SYSTEMS, 2018, : 323 - 324
  • [47] PICTURE DECOMPOSITION, TREE DATA-STRUCTURES, AND IDENTIFYING DIRECTIONAL SYMMETRIES AS NODE COMBINATIONS
    ALEXANDRIDIS, N
    KLINGER, A
    [J]. COMPUTER GRAPHICS AND IMAGE PROCESSING, 1978, 8 (01): : 43 - 77
  • [48] TREE-STRUCTURES FOR HIGH DIMENSIONALITY NEAREST NEIGHBOR SEARCHING
    EASTMAN, CM
    WEISS, SF
    [J]. INFORMATION SYSTEMS, 1982, 7 (02) : 115 - 122
  • [49] Succinct Data Structures for Bounded Degree/Chromatic Number Interval Graphs
    He, Meng
    Munro, J. Ian
    Wu, Kaiyu
    [J]. 2024 DATA COMPRESSION CONFERENCE, DCC, 2024, : 502 - 511
  • [50] Engineering the LOUDS succinct tree representation
    Delpratt, O'Neil
    Rahman, Naila
    Raman, Rajeev
    [J]. EXPERIMENTAL ALGORITHMS, PROCEEDINGS, 2006, 4007 : 134 - 145
12345