Skip to main content

3 Result(s)

within Pranabendu Misra Remove this filter Computer Science Remove this filter Computation by Abstract Devices Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Reducing Rank of the Adjacency Matrix by Graph Modification

    The main topic of this article is to study a class of graph modification problems. A typical graph modification problem takes as input a graph G, a positive integer k and the objective is to add/delete k vertices...

    S. M. Meesum, Pranabendu Misra, Saket Saurabh in Computing and Combinatorics (2015)

  2. No Access

    Chapter and Conference Paper

    Deterministic Truncation of Linear Matroids

    Let \(M=(E,\mathcal{I})\) M = ...

    Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan… in Automata, Languages, and Programming (2015)

  3. No Access

    Chapter and Conference Paper

    Parameterized Algorithms to Preserve Connectivity

    We study the following family of connectivity problems. For a given λ-edge connected (multi) graph G = (V,E), a set of links L such that G + L = (V, E ∪ L) is (λ + 1)-edge connected, and a positive integer k, the...

    Manu Basavaraju, Fedor V. Fomin, Petr Golovach… in Automata, Languages, and Programming (2014)