On link deletion and point deletion in games on graphs

04/20/2021
by   Sujata Ghosh, et al.
0

We discuss link and point deletion operators on graph games and provide a comparative logic-algorithmic study of the same. In particular, we focus on a popular notion of invariance in transition systems, namely, bisimulation, between the respective games on graphs. We present both logical and algorithmic analyses of the concepts so as to provide a more formal analysis of the natural connection between these two operators.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/13/2018

Losing Connection:the Modal Logic of Definable Link Deletion

In this article, we start with a two-player game that models communicati...
research
03/11/2021

Hitting minors on bounded treewidth graphs. II. Single-exponential algorithms

For a finite collection of graphs F, the F-M-DELETION (resp. F-TM-DELETI...
research
07/19/2019

Cluster deletion revisited

In the Cluster Deletion problem the input is a graph G and an integer k,...
research
11/08/2017

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

The focus of this paper is two fold. Firstly, we present a logical appro...
research
04/20/2019

Cluster Deletion on Interval Graphs and Split Related Graphs

In the Cluster Deletion problem the goal is to remove the minimum numbe...
research
07/10/2023

Parameterized Analysis of the Cops and Robber Problem

Pursuit-evasion games have been intensively studied for several decades ...
research
05/25/2017

Fast Causal Inference with Non-Random Missingness by Test-Wise Deletion

Many real datasets contain values missing not at random (MNAR). In this ...

Please sign up or login with your details

Forgot password? Click here to reset