Cover Image

Succinct Data Structure for Graphs with $d$-Dimensional $t$-Representation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Balakrishnan, Girish, Chakraborty, Sankardeep, Jo, Seungbum, Narayanaswamy, N S, Sadakane, Kunihiko
Format:	Preprint
Published:	2023
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
by: Balakrishnan, Girish, et al.
Published: (2024)

Succinct Data Structures for Baxter Permutation and Related Families
by: Chakraborty, Sankardeep, et al.
Published: (2024)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
by: Hamada, Kou, et al.
Published: (2024)

Variations on the Problem of Identifying Spectrum-Preserving String Sets
by: Chakraborty, Sankardeep, et al.
Published: (2026)

Space-efficient Data Structure for Next/Previous Larger/Smaller Value Queries
by: Jo, Seungbum, et al.
Published: (2022)

Succinct Graph Representations and Algorithmic Applications
by: Ullah, Ahammed, et al.
Published: (2026)

Succinct Data Structures for Segments
by: Bille, Philip, et al.
Published: (2024)

Encodings for Range Minimum Queries over Bounded Alphabets
by: Jo, Seungbum, et al.
Published: (2026)

Compressibility Measures and Succinct Data Structures for Piecewise Linear Approximations
by: Ferragina, Paolo, et al.
Published: (2025)

Cut Sparsification and Succinct Representation of Submodular Hypergraphs
by: Kenneth, Yotam, et al.
Published: (2023)

Exactly Hittable Interval Graphs
by: Dhannya, S. M., et al.
Published: (2023)

Space-Efficient Graph Coarsening with Applications to Succinct Planar Encodings
by: Hammer, Nina, et al.
Published: (2022)

Succinct Dynamic Rank/Select: Bypassing the Tree-Structure Bottleneck
by: Kuszmaul, William, et al.
Published: (2025)

Space-Efficient Depth-First Search via Augmented Succinct Graph Encodings
by: Elberfeld, Michael, et al.
Published: (2025)

Succinct Planar Encoding with Minor Operations
by: Kammer, Frank, et al.
Published: (2023)

Succinct Preferential Attachment Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2025)

SPIDER: Improved Succinct Rank and Select Performance
by: Laws, Matthew D., et al.
Published: (2024)

Parameterized Algorithms for the Steiner Arborescence Problem on a Hypercube
by: Mahapatra, Sugyani, et al.
Published: (2021)

A faster algorithm for Vertex Cover parameterized by solution size
by: Harris, David G., et al.
Published: (2022)

Rooting Out Entropy: Optimal Tree Extraction for Ultra-Succinct Graphs
by: Alaoui, Ziad Ismaili, et al.
Published: (2026)

Succinct Encodings of Binary Trees with Application to AVL Trees
by: Chizewer, Jeremy, et al.
Published: (2023)

Revisiting Token Sliding on Chordal Graphs
by: Adak, Rajat, et al.
Published: (2025)

Parallel Algorithm For Finding The Minimum s/t Cut in a Structured 3-Dimensional Proper Order Graph
by: Chandramouli, Shridharan
Published: (2026)

A $d^{1/2+o(1)}$ Monotonicity Tester for Boolean Functions on $d$-Dimensional Hypergrids
by: Black, Hadley, et al.
Published: (2023)

Exploring Word-Representable Temporal Graphs
by: Adamson, Duncan
Published: (2025)

Structural Parameterization of Locating-Dominating Set and Test Cover
by: Chakraborty, Dipayan, et al.
Published: (2024)

Asymptotically Optimal Representation of Palindromic Structure
by: Itzhaki, Michael
Published: (2024)

Towards EXPTIME One Way Functions: Bloom Filters, Succinct Graphs, Cliques, & Self Masking
by: Dolev, Shlomi
Published: (2025)

Multi-View Structural Graph Summaries
by: Frank, Jonatan, et al.
Published: (2024)

Recovering Communities in Structured Random Graphs
by: Kapralov, Michael, et al.
Published: (2026)

High-Dimensional Geometric Streaming for Nearly Low Rank Data
by: Esfandiari, Hossein, et al.
Published: (2024)

Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
by: Teshigawara, Kanata, et al.
Published: (2026)

Hitting Geodesic Intervals in Structurally Restricted Graphs
by: Gima, Tatsuya, et al.
Published: (2025)

CARAMEL: A Succinct Read-Only Lookup Table via Compressed Static Functions
by: Coleman, Benjamin, et al.
Published: (2023)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
by: Fan, Zhuochen, et al.
Published: (2024)

Equivalence Testing: The Power of Bounded Adaptivity
by: Chakraborty, Diptarka, et al.
Published: (2024)

An FPT algorithm for Matching Cut and d-cut
by: Aravind, N R, et al.
Published: (2021)

Creating Robust and Fair Graph Structures for Connectivity and Clustering
by: Chatterjee, Kushagra
Published: (2026)

Improved Approximation Algorithms for Three-Dimensional Knapsack
by: Jansen, Klaus, et al.
Published: (2025)

Explicit Combinatoric Structures of Palindromes and Chromatic Number of Restriction Graphs
by: Amir, Amihood, et al.
Published: (2024)