Skip to main content

1 Result(s)

within Sayani Das Remove this filter Computer Science Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Burn and Win

    Given a graph G and an integer k, the Graph Burning problem asks whether the graph G can be burned in at most k rounds. Graph burning is a model for information spreading in a network, where we study how fast the...

    Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh… in Combinatorial Algorithms (2023)