Sounaka Mishra

activity

20142023

most citedFO and MSO approach to Some Graph Problems: Approximation and Poly time Results

1 citations · 1 across the 6 of their papers we have counts for

collaborators

Showing 2017Show all

2 papers · 1 filter

cs.DS2017

The Complexity of Maximum $k$ -Order Bounded Component Set Problem

Sounaka Mishra, Shijin Rajakrishnan

Given a graph $G = (V, E)$ and a positive integer $k$ , in Maximum $k$ -Order Bounded Component Set (Max- $k$ -OBCS), it is required to find a vertex set $S \subseteq V$ of maximum size…

cs.LO2017★ 1 cited

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results

Kona Harshita, Sounaka Mishra, Renjith. P +1

The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems…

The Complexity of Maximum k-Order Bounded Component Set Problem

FO and MSO approach to Some Graph Problems: Approximation and Poly time Results

The Complexity of Maximum $k$ -Order Bounded Component Set Problem