On Convexity in Split graphs: Complexity of Steiner tree and Domination

10/05/2022
by   A. Mohanapriya, et al.
0

Given a graph G with a terminal set R ⊆ V(G), the Steiner tree problem (STREE) asks for a set S⊆ V(G) ∖ R such that the graph induced on S∪ R is connected. A split graph is a graph which can be partitioned into a clique and an independent set. It is known that STREE is NP-complete on split graphs <cit.>. To strengthen this result, we introduce convex ordering on one of the partitions (clique or independent set), and prove that STREE is polynomial-time solvable for tree-convex split graphs with convexity on clique (K), whereas STREE is NP-complete on tree-convex split graphs with convexity on independent set (I). We further strengthen our NP-complete result by establishing a dichotomy which says that for unary-tree-convex split graphs (path-convex split graphs), STREE is polynomial-time solvable, and NP-complete for binary-tree-convex split graphs (comb-convex split graphs). We also show that STREE is polynomial-time solvable for triad-convex split graphs with convexity on I, and circular-convex split graphs. Further, we show that STREE can be used as a framework for the dominating set problem (DS) on split graphs, and hence the classical complexity (P vs NPC) of STREE and DS is the same for all these subclasses of split graphs. Furthermore, it is important to highlight that in <cit.>, it is incorrectly claimed that the problem of finding a minimum dominating set on split graphs cannot be approximated within (1-ϵ)ln |V(G)| in polynomial-time for any ϵ >0 unless NP ⊆ DTIME n^O(loglog n). When the input is restricted to split graphs, we show that the minimum dominating set problem has 2-1/|I|-approximation algorithm that runs in polynomial time.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/05/2020

Algorithmic Aspects of 2-Secure Domination in Graphs

Let G(V,E) be a simple, undirected and connected graph. A dominating set...
research
02/25/2020

Well-partitioned chordal graphs: obstruction set and disjoint paths

We introduce a new subclass of chordal graphs that generalizes split gra...
research
01/31/2020

Algorithmic Aspects of Some Variants of Domination in Graphs

A set S ⊆ V is a dominating set in G if for every u ∈ V ∖ S, there exist...
research
05/10/2021

Learning Weakly Convex Sets in Metric Spaces

We introduce the notion of weak convexity in metric spaces, a generaliza...
research
11/08/2019

On the Complexity of BWT-runs Minimization via Alphabet Reordering

We present the first set of results on the computational complexity of m...
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
09/13/2023

Perfect Roman Domination and Unique Response Roman Domination

The idea of enumeration algorithms with polynomial delay is to polynomia...

Please sign up or login with your details

Forgot password? Click here to reset