Blar i NTNU Open på forfatter "Chakraborty, Sankardeep"

Viser treff 1-5 av 5

    • Frameworks for designing in-place graph algorithms 

      Chakraborty, Sankardeep; Mukherjee, Anish; Raman, Venkaetsh; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)
      Read-only memory (ROM) model is a classical model of computation to study time-space tradeoffs of algorithms. More recently, several graph algorithms have been studied under ROM model. In this paper, we study graph algorithms ...

    • Succinct Data Structures for SP, Block-Cactus and 3 -Leaf Power Graphs 

      Chakraborty, Sankardeep; Jo, Seungbum; Sadakane, Kunihiko; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2023)
      We design succinct encodings of series-parallel, block-cactus and 3-leaf power graphs while supporting the basic navigational queries such as degree, adjacency and neighborhood optimally in the RAM model with logarithmic ...

    • Succinct Encodings for Families of Interval Graphs 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Satti, Srinivasa Rao (Journal article; Peer reviewed, 2021)
      We consider the problem of designing succinct data structures for interval graphs with n vertices while supporting degree, adjacency, neighborhood and shortest path queries in optimal time. Towards showing succinctness, ...

    • Succinct navigational oracles for families of intersection graphs on a circle 

      Acan, Huseyin; Chakraborty, Sankardeep; Jo, Seungbum; Nakashima, Kei; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2022)
      We consider the problem of designing succinct navigational oracles, i.e., succinct data structures supporting basic navigational queries such as degree, adjacency and neighborhood efficiently for intersection graphs on a ...

    • Succinct representation for (non)deterministic finite automata. 

      Chakraborty, Sankardeep; Grossi, Roberto; Sadakane, Kunihiko; Satti, Srinivasa Rao (Peer reviewed; Journal article, 2023)
      (Non)-Deterministic finite automata are one of the simplest models of computation studied in automata theory. Here we study them through the lens of succinct data structures. Towards this goal, we design a data structure ...