Data structures for categorical path counting queries

DOI10.1016/J.TCS.2022.10.011MaRDI QIDQ2089697zbMATH OpenOpenAlexFDO

Authors Meng He, Serikzhan Kazi

Publication date 24 October 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.10.011

zbMATH Keywords

data structuresweighted treespath queriescategorical path countingcategorical path range countingcategorical queriescolored queries

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Data structures for categorical path counting queries
• Data structures for path queries
• Path queries in weighted trees
• Succinct Data Structures for Path Queries
• Tree path majority data structures

Cites work

• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1947378 (Why is no real title available?)
• scientific article; zbMATH DE number 7561422 (Why is no real title available?)
• scientific article; zbMATH DE number 7561469 (Why is no real title available?)
• scientific article; zbMATH DE number 7650278 (Why is no real title available?)
• scientific article; zbMATH DE number 7760157 (Why is no real title available?)
• A framework for succinct labeled ordinal trees over large alphabets
• An external memory data structure for shortest path queries
• Approximate colored range and point enclosure queries
• Approximate range counting revisited
• Better Data Structures for Colored Orthogonal Range Reporting
• Colored Range Searching in Linear Space
• Counting Colours in Compressed Strings
• Data structures for path queries
• Efficient Colored Orthogonal Range Counting
• Efficient range searching for categorical and plain data
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Linear-space data structures for range frequency queries on arrays and trees
• Multiplying matrices faster than coppersmith-winograd
• Near-optimal range reporting structures for categorical data
• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Orthogonal range searching on the RAM, revisited
• Regularity lemmas and combinatorial algorithms
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Speeding up the four Russians algorithm by about one more logarithmic factor
• Succinct color searching in one dimension
• Succinct indices for path minimum, with applications
• Succinct ordinal trees based on tree covering
• Succinct representations of weighted trees supporting path queries
• Surpassing the information theoretic bound with fusion trees
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths

Cited in

(5)

• Adaptive data structures for 2D dominance colored range counting
• Context-free path querying by Kronecker product
• Data structures for categorical path counting queries
• Succinct Data Structures for Path Queries
• On approximate colored path counting

This page was built for publication: Data structures for categorical path counting queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2089697)