Succinct data structures for nearest colored node in a tree

Dekel Tsur

doi:https://doi.org/10.1016/j.ipl.2017.10.001

Succinct data structures for nearest colored node in a tree

Dekel Tsur

Department of Computer Science

Ben-Gurion University of the Negev

Research output: Contribution to journal › Article › peer-review

Abstract

We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color α the structures find the nearest node to x with color α. Our results improve the O(nlog⁡n)-bits structure of Gawrychowski et al. (2016) [12].

Original language	American English
Pages (from-to)	6-10
Number of pages	5
Journal	Information Processing Letters
Volume	132
DOIs	https://doi.org/10.1016/j.ipl.2017.10.001
State	Published - 1 Apr 2018

Keywords

Colored trees
Labeled trees
Succinct data structures

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Signal Processing
Information Systems
Computer Science Applications

Access to Document

https://doi.org/10.1016/j.ipl.2017.10.001

Cite this

@article{8306c5c168084f028a9aea65f4fc33fe,

title = "Succinct data structures for nearest colored node in a tree",

abstract = "We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color α the structures find the nearest node to x with color α. Our results improve the O(nlog⁡n)-bits structure of Gawrychowski et al. (2016) [12].",

keywords = "Colored trees, Labeled trees, Succinct data structures",

author = "Dekel Tsur",

note = "Publisher Copyright: {\textcopyright} 2017 Elsevier B.V.",

year = "2018",

month = apr,

day = "1",

doi = "https://doi.org/10.1016/j.ipl.2017.10.001",

language = "American English",

volume = "132",

pages = "6--10",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

}

TY - JOUR

T1 - Succinct data structures for nearest colored node in a tree

AU - Tsur, Dekel

PY - 2018/4/1

Y1 - 2018/4/1

N2 - We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color α the structures find the nearest node to x with color α. Our results improve the O(nlog⁡n)-bits structure of Gawrychowski et al. (2016) [12].

AB - We give succinct data structures that store a tree with colors on the nodes. Given a node x and a color α the structures find the nearest node to x with color α. Our results improve the O(nlog⁡n)-bits structure of Gawrychowski et al. (2016) [12].

KW - Colored trees

KW - Labeled trees

KW - Succinct data structures

UR - http://www.scopus.com/inward/record.url?scp=85036453866&partnerID=8YFLogxK

U2 - https://doi.org/10.1016/j.ipl.2017.10.001

DO - https://doi.org/10.1016/j.ipl.2017.10.001

M3 - Article

SN - 0020-0190

VL - 132

SP - 6

EP - 10

JO - Information Processing Letters

JF - Information Processing Letters

ER -

Succinct data structures for nearest colored node in a tree

Abstract

Keywords

All Science Journal Classification (ASJC) codes

Access to Document

Other files and links

Fingerprint

Cite this