2 citations · 4 across the 8 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
cs.DS2023
Cell-Probe Lower Bound for Accessible Interval Graphs
Sankardeep Chakraborty, Christian Engels, Seungbum Jo +1
We spot a hole in the area of succinct data structures for graph classes from a universe of size at most . Very often, the input graph is labeled by the user in an arbitrary a…
cs.DS2023
Succinct Data Structure for Graphs with -Dimensional -Representation
Girish Balakrishnan, Sankardeep Chakraborty, Seungbum Jo +2
Erdős and West (Discrete Mathematics'85) considered the class of vertex intersection graphs which have a {\em -dimensional} {\em -representation}, that is, each vertex of…