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 条
  • [11] Succinct nearest neighbor search
    Tellez, Eric Sadit
    Chavez, Edgar
    Navarro, Gonzalo
    INFORMATION SYSTEMS, 2013, 38 (07) : 1019 - 1030
  • [12] Succinct data structures for assembling large genomes
    Conway, Thomas C.
    Bromage, Andrew J.
    BIOINFORMATICS, 2011, 27 (04) : 479 - 486
  • [13] Succinct data structures for Searchable Partial Sums
    Hon, WK
    Sadakane, K
    Sung, WK
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 505 - 516
  • [14] The cell probe complexity of succinct data structures
    Gál, A
    Miltersen, PB
    AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 332 - 344
  • [15] Squeezing Succinct Data Structures into Entropy Bounds
    Sadakane, Kunihiko
    Grossi, Roberto
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 1230 - +
  • [16] Succinct Data Structures for Families of Interval Graphs
    Acan, Huseyin
    Chakraborty, Sankardeep
    Jo, Seungbum
    Satti, Srinivasa Rao
    ALGORITHMS AND DATA STRUCTURES, WADS 2019, 2019, 11646 : 1 - 13
  • [17] Succinct Data Structures for Representing Equivalence Classes
    Lewenstein, Moshe
    Munro, J. Ian
    Raman, Venkatesh
    ALGORITHMS AND COMPUTATION, 2013, 8283 : 502 - 512
  • [18] The cell probe complexity of succinct data structures
    Gal, Anna
    Miltersen, Peter Bro
    THEORETICAL COMPUTER SCIENCE, 2007, 379 (03) : 405 - 417
  • [19] Succinct Data Structures ... Potential for Symbolic Computation?
    Munro, J. Ian
    PROCEEDINGS OF THE 2016 ACM INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION (ISSAC 2016), 2016, : 5 - 8
  • [20] Application-Oriented Succinct Data Structures for Big Data
    Shibuya, Tetsuo
    REVIEW OF SOCIONETWORK STRATEGIES, 2019, 13 (02): : 227 - 236
12345