Skip to main content

4 Result(s)

within Sajith Padinhatteeri Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    s-Club Cluster Vertex Deletion on Interval and Well-Partitioned Chordal Graphs

    In this paper, we study the computational complexity of s -Club Cluster Vertex Deletion. Given a graph, s -Club Cluster Vertex Deletion (s -CVD) aims to delete the minimum number of vertices from the graph so th...

    Dibyayan Chakraborty, L. Sunil Chandran… in Graph-Theoretic Concepts in Computer Scie… (2022)

  2. No Access

    Chapter and Conference Paper

    Algorithms and Complexity of s-Club Cluster Vertex Deletion

    An s-club is a graph which has diameter at most s. Let G be a graph. A set of vertices \(D\subseteq V(G)\) ...

    Dibyayan Chakraborty, L. Sunil Chandran, Sajith Padinhatteeri… in Combinatorial Algorithms (2021)

  3. No Access

    Chapter and Conference Paper

    Template-Driven Rainbow Coloring of Proper Interval Graphs

    For efficient design of parallel algorithms on multiprocessor architectures with memory banks, simultaneous access to a specified subgraph of a graph data structure by multiple processors requires that the dat...

    L. Sunil Chandran, Sajal K. Das, Pavol Hell… in Algorithms and Discrete Applied Mathematics (2021)

  4. No Access

    Chapter and Conference Paper

    List Distinguishing Number of \(p^{\text {th}}\) Power of Hypercube and Cartesian Powers of a Graph

    A graph G is said to be k-distinguishable if every vertex of the graph can be colored from a set of k colors such that no non-trivial automorphism fixes every color class. The distinguishing number D(G) is the l...

    L. Sunil Chandran, Sajith Padinhatteeri… in Algorithms and Discrete Applied Mathematics (2020)