Browsing by Issue Date

Browsing by Issue Date

Sort by: Order: Results:

  • Choudhari, Jayesh; Dasgupta, Anirban; Misra, Neeldhara; Ramanujan, M. S. (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 7/10/2017)
    We consider the problem of firefighting to save a critical subset of nodes. The firefighting game is a turn-based game played on a graph, where the fire spreads to vertices in a breadth-first manner from a source, and ...
  • Gupta, Manoj; Khan, Shahbaz (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 7/10/2017)
    Let G=(V,E) be a graph with n vertices and m edges, with a designated set of sigma sources S subseteq V. The fault tolerant subgraph for any graph problem maintains a sparse subgraph H=(V,E') of G with E' subseteq E, such ...

Search Digital Repository


My Account