Skip to main content

3 Result(s)

within Dibyayan Chakraborty Remove this filter Mathematics Remove this filter

and

  1. No Access

    Chapter and Conference Paper

    Cutting Barnette Graphs Perfectly is Hard

    A perfect matching cut is a perfect matching that is also a cutset, or equivalently a perfect matching containing an even number of edges on every cycle. The corresponding algorithmic problem, Perfect Matching Cu...

    Édouard Bonnet, Dibyayan Chakraborty… in Graph-Theoretic Concepts in Computer Scien… (2023)

  2. No Access

    Chapter and Conference Paper

    Hardness and Approximation for the Geodetic Set Problem in Some Graph Classes

    In this paper, we study the computational complexity of finding the geodetic number of graphs. A set of vertices S of a graph G is a geodetic set if any vertex of G lies in some shortest path between some pair o...

    Dibyayan Chakraborty, Florent Foucaud… in Algorithms and Discrete Applied Mathematics (2020)

  3. No Access

    Chapter and Conference Paper

    Approximating Minimum Dominating Set on String Graphs

    A string graph is an intersection graph of simple curves on the plane. For \(k\ge 0\) ,

    Dibyayan Chakraborty, Sandip Das… in Graph-Theoretic Concepts in Computer Scien… (2019)