Dynamic path queries in linear space
type: Item
instance of: scholarly article
title: Dynamic path queries in linear space
zbMATH Open document ID: 1401.68052
author: Meng He
author: J. Ian Munro
author: Gelin Zhou
published in: Algorithmica
publication date: 2018-10-18T00:00:00Z
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 6958247
zbMATH Keywords: dynamic data structures
zbMATH Keywords: path queries
zbMATH Keywords: fractional cascading
zbMATH Keywords: directed topology trees
MaRDI profile type: Publication
full work available at URL: s00453-018-0413-x
OpenAlex ID: W2791838006
cites work: Q2754135
cites work: Optimal External Memory Interval Management
cites work: A survey on tree edit distance and related problems
cites work: Q3579414
cites work: Two Dimensional Range Minimum Queries and Fibonacci Lattices
cites work: Path Minima Queries in Dynamic Weighted Trees
cites work: Towards optimal range medians
cites work: Succinct Indices for Path Minimum, with Applications to Path Reporting
cites work: Computing on a free tree via complexity-preserving mappings
cites work: Q3651735
cites work: On Cartesian trees and range minimum queries
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
cites work: A Data Structure for Dynamically Maintaining Rooted Trees
cites work: Space efficient data structures for dynamic orthogonal range counting
cites work: Dynamic Range Selection in Linear Space
cites work: Succinct ordinal trees based on tree covering
cites work: Path Queries in Weighted Trees
cites work: Succinct Data Structures for Path Queries
cites work: Dynamic Path Counting and Reporting in Linear Space
cites work: A framework for succinct labeled ordinal trees over large alphabets
cites work: Path Minima in Incremental Unrooted Trees
cites work: Q5705139
cites work: Succinct representation of balanced parentheses and static trees
cites work: Q4875167
cites work: Optimal Dynamic Sequence Representations
cites work: Fully functional static and dynamic succinct trees
cites work: Orthogonal range searching in linear and almost-linear space
cites work: Succinct representations of weighted trees supporting path queries
cites work: Logarithmic Lower Bounds in the Cell-Probe Model
cites work: Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
DOI: 10.1007/S00453-018-0413-X
description: scientific article; zbMATH DE number 6958247