On approximate colored path counting
From MaRDI portal
Publication:6547933
DOI10.1007/978-3-031-55598-5_14MaRDI QIDQ6547933
Publication date: 31 May 2024
Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Title not available (Why is that?)
- Linear-space data structures for range frequency queries on arrays and trees
- Succinct data structures for flexible text retrieval systems
- About groups of straight lines
- An improved combinatorial algorithm for Boolean matrix multiplication
- Data structures for categorical path counting queries
- Succinct indices for path minimum, with applications
- Efficient range searching for categorical and plain data
- Efficient Colored Orthogonal Range Counting
- Further Results on Generalized Intersection Searching Problems: Counting, Reporting, and Dynamization
- Approximate range counting revisited
- Data Structures for Path Queries
- Linear-time String Indexing and Analysis in Small Space
- Succinct Color Searching in One Dimension
- Better Data Structures for Colored Orthogonal Range Reporting
- Orthogonal range searching on the RAM, revisited
This page was built for publication: On approximate colored path counting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6547933)
