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 条
  • [1] The nearest colored node in a tree
    Gawrychowski, Pawel
    Landau, Gad M.
    Mozes, Shay
    Weimann, Oren
    [J]. THEORETICAL COMPUTER SCIENCE, 2018, 710 : 66 - 73
  • [2] Succinct data structures for big data
    Sadakane, Kunihiko
    [J]. Journal of the Institute of Electronics, Information and Communication Engineers, 2014, 97 (05): : 379 - 383
  • [3] On the redundancy of succinct data structures
    Golynski, Alexander
    Raman, Rajeev
    Rao, S. Srinivasa
    [J]. ALGORITHM THEORY - SWAT 2008, 2008, 5124 : 148 - 159
  • [4] Succinct dynamic data structures
    Raman, R
    Raman, V
    Rao, SS
    [J]. ALGORITHMS AND DATA STRUCTURES, 2001, 2125 : 426 - 437
  • [5] Optimized succinct data structures for massive data
    Gog, Simon
    Petri, Matthias
    [J]. SOFTWARE-PRACTICE & EXPERIENCE, 2014, 44 (11): : 1287 - 1314
  • [6] Rank and Select for Succinct Data Structures
    Farina, Antonio
    Ladra, Susana
    Pedreira, Oscar
    Places, Angeles S.
    [J]. ELECTRONIC NOTES IN THEORETICAL COMPUTER SCIENCE, 2009, 236 (0C) : 131 - 145
  • [7] Highly Succinct Dynamic Data Structures
    Hagerup, Torben
    [J]. FUNDAMENTALS OF COMPUTATION THEORY, FCT 2019, 2019, 11651 : 29 - 45
  • [8] Statistical encoding of succinct data structures
    Gonzalez, Rodrigo
    Navarro, Gonzalo
    [J]. COMBINATORIAL PATTERN MATCHING, PROCEEDINGS, 2006, 4009 : 294 - 305
  • [9] Succinct Data Structures for Path Queries
    He, Meng
    Munro, J. Ian
    Zhou, Gelin
    [J]. ALGORITHMS - ESA 2012, 2012, 7501 : 575 - 586
  • [10] A framework for dynamizing succinct data structures
    Gupta, Ankur
    Hon, Wing-Kai
    Shah, Rahul
    Vitter, Jeffrey Scott
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2007, 4596 : 521 - +
12345