Subjects

Subjects

Sort by: Order: Results:

  • Baswana, Surender; Gupta, Manoj; Sen, Sandeep (Society for Industrial and Applied Mathematics, 2018-01)
    We present an algorithm for maintaining a maximal matching in a graph under addition and deletion of edges. Our algorithm is randomized and it takes expected amortized O(log n) time for each edge update, where n is the ...
  • Gupta, Manoj; Khan, Shahbaz (Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 2017-10-07)
    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


Browse

My Account