It is proved that the problem of computing a minimum dominating set on bipartite circle graphs admitting a chord representation in which the chords can be partitioned into two color classes such that no two chords of the same color intersect remains NP-hard.
Abstract
A circle graph is the intersection graph of a set of chords in a circle. A dominating set of a graph $G=(V,E)$ is a subset $D\subseteq V$ such that every vertex in $V\setminus D$ is adjacent to at least one vertex of $D$. Computing a minimum dominating set is known to be NP-hard on circle graphs. In this paper, we study the minimum dominating set problem on bipartite circle graphs, namely, circle graphs admitting a chord representation in which the chords can be partitioned into two color classes such that no two chords of the same color intersect. We prove that the problem remains NP-hard for this restricted graph class by a reduction from Planar Monotone 3-SAT. On the positive side, we present a polynomial-time 2-approximation algorithm and develop a polynomial-time approximation scheme (PTAS) based on local search.
It is proved that the minimum-density LDS problem in infinite $\mathbb{Z}$-periodic graphs with a finite period is NP-hard, which bridges the gap between cardinality minimization on finite graphs and density minimization on infinite graphs via a rigorous periodic reduction.
This paper develops an exact algorithm based on the Branch and Bound approach for solving PIDS on chordal graphs, which involves identifying the smallest group of vertices in a given network that maximizes influence throughout the network.
Y A Bekhti, M. Lalou, Méziane Aïder et al.· Pesquisa Operacional· 0 citations
For a graph $G$, let $h(G)$ be the minimum cardinality of a vertex set meeting every maximum independent set of $G$. We establish two complementary reduction principles for the Bollob\'as--Erd\H{o}s--Tuza conjecture: the conjecture for arbitrary graphs is equivalent to its restriction to regular graphs of any fixed pos...
These algorithms bypass solving the computationally intractable maximum weight independent set problem by solving the computationally intractable maximum weight independent set problem by a simple and purely combinatorial greedy rule.
Jean Cardinal, Pia Herkenrath, Torsten Mütze et al.· 0 citations
A matching in a graph G = (V, E) is a set M ⊆ E, such that no two edges in M share an endvertex. An edge cut in G is a set of edges C ⊆ E, such that we can partition V into two non-empty sets R and B, where C is the set of edges with one endvertex in R and one in B. A matching cut is a set of edges M ⊆ E which is both...
It is proved that the classical cut property always produces a minimum spanning tree of a connected graph, and may be useful for large weighted networks such as communication networks, wiring connections, and transportation networks.
H. Bhapkar, Rezwan Ul Shaban, S. Mir et al.· Journal of the Nigerian Soci...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
