DeepAI AI Chat
Log In Sign Up

On link deletion and point deletion in games on graphs

by   Sujata Ghosh, et al.

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.


page 1

page 2

page 3

page 4


Losing Connection:the Modal Logic of Definable Link Deletion

In this article, we start with a two-player game that models communicati...

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...

Cluster deletion revisited

In the Cluster Deletion problem the input is a graph G and an integer k,...

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...

Cluster Deletion on Interval Graphs and Split Related Graphs

In the Cluster Deletion problem the goal is to remove the minimum numbe...

Parameterized Analysis of the Cops and Robber Problem

Pursuit-evasion games have been intensively studied for several decades ...

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

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