Sort by: Order: Results:

  • Das, Bireswar; Dasgupta, Anirban; Enduri, Murali Krishna; Reddy, Vinod.I (Elsevier, 2018-11)
    In this paper, we show that for a fixed k, there is an NC algorithm that separates the graphs of rank-width at most k from those with rank-width at least
  • Das, Bireswar; Enduri, Murali Krishna; Kiyomi, Masashi; Misra, Neeldhara; Otachi, Yota; Reddy, I. Vinod; Yoshimura, Shunya (Elsevier, 2019-03)
    he Firefighting problem is defined as follows. At time , a fire breaks out at a vertex of a graph. At each time step, a firefighter permanently defends (protects) an unburned vertex, and the fire then spreads to all ...
  • Reddy, I. Vinod (Elsevier, 2018-05)
    In this paper, we study the conflict-free coloring of graphs induced by neighborhoods. A coloring of a graph is conflict-free if every vertex has a uniquely colored vertex in its neighborhood. The conflict-free coloring ...

Search Digital Repository


My Account