Data structures for categorical path counting queries

DOI10.1016/J.TCS.2022.10.011OpenAlexW3183422168MaRDI QIDQ2089697FDOQ2089697

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)

Cites Work

• Title not available (Why is that?)
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Succinct representations of weighted trees supporting path queries
• Linear-space data structures for range frequency queries on arrays and trees
• Multiplying matrices faster than coppersmith-winograd
• Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
• Orthogonal range searching on the RAM, revisited
• Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting
• Surpassing the information theoretic bound with fusion trees
• Approximate colored range and point enclosure queries
• Counting Colours in Compressed Strings
• Near-Optimal Range Reporting Structures for Categorical Data
• Efficient Colored Orthogonal Range Counting
• Succinct ordinal trees based on tree covering
• An improved combinatorial algorithm for Boolean matrix multiplication
• Speeding up the Four Russians Algorithm by About One More Logarithmic Factor
• A framework for succinct labeled ordinal trees over large alphabets
• Succinct indices for path minimum, with applications
• Approximate range counting revisited
• Title not available (Why is that?)
• An external memory data structure for shortest path queries
• Title not available (Why is that?)
• Regularity lemmas and combinatorial algorithms
• Data Structures for Path Queries
• Optimal deterministic shallow cuttings for 3-d dominance ranges
• Succinct Color Searching in One Dimension
• Efficient range searching for categorical and plain data
• Colored Range Searching in Linear Space
• Title not available (Why is that?)
• Title not available (Why is that?)
• Better Data Structures for Colored Orthogonal Range Reporting
• Title not available (Why is that?)

Cited In (4)

• Adaptive data structures for 2D dominance colored range counting
• Context-free path querying by Kronecker product
• 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)