3 papers
cs.DS2024
Succinct Data Structures for Baxter Permutation and Related Families
Sankardeep Chakraborty, Seungbum Jo, Geunho Kim +1
A permutation is a Baxter permutation if and only if it does not contain either of the patterns and . Baxter permutations are one of the…
cs.DS2024
A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
Kou Hamada, Sankardeep Chakraborty, Seungbum Jo +3
Tree covering is a technique for decomposing a tree into smaller-sized trees with desirable properties, and has been employed in various succinct data structures. However, signific…
cs.DS2024
Succinct Data Structure for Chordal Graphs with Bounded Vertex Leafage
Girish Balakrishnan, Sankardeep Chakraborty, N S Narayanaswamy +1
We improve the worst-case information theoretic lower bound of Munro and Wu (ISAAC 2018) for vertex unlabeled chordal graphs when vertex leafage is bounded and leafage is unbou…