Doubly Nonnegative and Semidefinite Relaxations for the Densest k-Subgraph Problem

Abstract

The densest k-subgraph (DkS) maximization problem is to find a set of k vertices with maximum total weight of edges in the subgraph induced by this set. This problem is in general NP-hard. In this paper, two relaxation methods for solving the DkS problem are presented. One is doubly nonnegative relaxation, and the other is semidefinite relaxation with tighter relaxation compare with the relaxation of standard semidefinite. The two relaxation problems are equivalent under the suitable conditions. Moreover, the corresponding approximation ratios’ results are given for these relaxation problems. Finally, some numerical examples are tested to show the comparison of these relaxation problems, and the numerical results show that the doubly nonnegative relaxation is more promising than the semidefinite relaxation for solving some DkS problems.

1. Introduction

In this paper, the densest k-subgraph (DkS) problem [1,2] is considered. For a given graph G and a parameter k, the DkS problem consists in finding a maximal average degree in the subgraph induced by the set of k vertices. This problem was first introduced by Corneil and Perl as a natural generalization of the maximum clique problem [3]. It is NP-hard on restricted graph classes such as chordal graphs [3], bipartite graphs [3] and planar graphs [4]. The DkS problem is a classical problem of combinatorial optimization and arises in several applications, such as facility location [5], community detection in social networks, identifying protein families and molecular complexes in protein–protein interaction networks [6], etc. Since the DkS problem is in general NP-hard, there are a few approximation methods [7,8,9] for solving it. It is well-known that semidefinite relaxation is a powerful and computationally efficient approximation technique for solving a host of very difficult optimization problems, for instance, the max-cut problem [10] and the boolean quadratic programming problem [11]. It also has been at the center of some of the very exciting developments in the area of signal processing [12,13].

Optimization problems over the doubly nonnegative cone arise, for example, as a strengthening of the Lovasz-$\vartheta$-number for approximating the largest clique in a graph [14]. The recent work by Burer [15] stimulated the interest in optimization problems over the completely positive cone. A tractable approximation to such problem being defined as an optimization problem over the doubly nonnegative cone. By using the technique of doubly nonnegative relaxation, Bai and Guo proposed an effective and promising method for solving multiple objective quadratic programming problems in [16]. For more details and developments of this technique, one may refer to [17,18,19] and the references therein. It is worth pointing out that the cone of doubly nonnegative matrices is a subset of a positive semidefinite matrices cone. Thus, the doubly nonnegative relaxation is more promising than the basic semidefinite relaxation. Moreover, such relaxation problems can be efficiently solved by some popular package software.

In this paper, motivated by the idea of doubly nonnegative relaxation and semidefinite relaxation, the two relaxation methods for solving the DkS problem are presented. One is doubly nonnegative relaxation, and the other is semidefinite relaxation with tighter relaxation. Furthermore, we prove that the two relaxation problems are equivalent under the suitable conditions. Some approximation accuracy results about these relaxation problems are also given. Finally, we report some numerical examples to show the comparison of the two relaxation problems. The numerical results show that the doubly nonnegative relaxation is more promising than the semidefinite relaxation for solving some DkS problems.

The paper is organized as follows: we present doubly nonnegative relaxation and a new semidefinite relaxation with tighter relaxation for the DkS problem in Section 2.1 and Section 2.2, respectively. In Section 3, we prove that the two new relaxations proposed in Section 2 are equivalent. In Section 4, some approximation accuracy results for the proposed relaxation problems are given. Some comparative numerical results are reported in Section 5 to show the efficiency of the proposed new relaxations. Moreover, some concluding remarks are given in Section 6.

2. Two Relaxations for the Densest $\mathit{k}$-Subgraph Problem

First of all, the definition of the densest k-subgraph (DkS) problem is given as follows.

Definition 1 (Densest k-subgraph).

For a given graph $G(V,E)$, where V is the vertex set and E is the edge set. The DkS problem on $G(V,E)$ is the problem of finding a vertex subset of V of size k with the maximum induced average degree.

Given a symmetric $n\times n$ matrix $A=(a_{ij})$, the weighted graph with vertex set $\{1,2,\dots ,n\}$ associates with A in such a way: the edge $[i,j]$ with the weight $a_{ij}$ is introduced in the graph. Then, A is interpreted as the weighted adjacency matrix of the graph with the vertex set $V=\{1,2,\dots ,n\}$. Based on Definition 1, the DkS problem consists of determining a subset $V_1\subseteq V$ consisting of k vertices such that the total weight of edges in the subgraph spanned by $V_1$ is maximized. To select subgraphs, assign a decision variable $y_i\in \{0,1\}$ for each node ($y_i=1$ if the node is taken, and $y_i=0$ if the node is not). The weight of the subgraph given by y is $y^{T}Ay$. Thus, the DkS problem can be phrased as the $0-1$ quadratic problem

$$(\mathrm{DkS})\begin{array}{cc}\max \hfill & \frac{1}{2}{y}^{T}Ay,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & y^{T}e=k,\hfill \\ & y\in {\{0,1\}}^n.\hfill \end{array}$$

It is known that the (DkS) problem is NP-hard [20], even though A is assumed to be positive semidefinite, since the feasible space of the (DkS) problem is nonconvex. For solving this problem efficiently, we present the two new relaxations for the (DkS) problem in the following subsections, based on the idea of approximation methods.

2.1. Doubly Nonnegative Relaxation

Note that the quadratic term $y^{T}Ay$ in the (DkS) problem can also be expressed as $A•y{y}^T$. By introducing a new variable $Y=y{y}^T$ and taking lifting techniques, we could reformulate the (DkS) problem into the following completely positive programming problem:

$$({\mathrm{CPP}}_{\mathrm{DkS}})\begin{array}{cc}max\hfill & \frac{1}{2}A•Y,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & y^{T}e=k,\hfill \\ & e^{T}Ye=k^2,\hfill \\ & \mathrm{diag}(Y)=y,\hfill \\ & \left[\begin{array}{cc}1& y^T\\ y& Y\end{array}\right]\in {\mathbb{C}}_{1+n},\hfill \end{array}$$

where ${\mathbb{C}}_{1+n}$ is defined as follows:

$${\mathbb{C}}_{1+n}:=\left\{X\in {\mathbb{S}}_{1+n}:X=\sum _{h\in H}{z}^h{(z^h)}^T\right\}\cup \{0\},$$

and for some finite vectors ${\{z^h\}}_{h\in H}\subset {\mathbb{R}}_{1+n}^{+}\backslash \{0\}$.

The following theorem shows the relationship between the (DkS) problem and the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem. Its proof is similar to the one of Theorem 2.6 in [15] and is omitted here.

Theorem 1.

(i) The $(\mathrm{DkS})$ problem and the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem have the same optimal values of objective functions, i.e., $\mathrm{Opt}(\mathrm{DkS})=\mathrm{Opt}({\mathrm{CPP}}_{\mathrm{DkS}})$; (ii) if $(y^{*},Y^{*})$ is an optimal solution for the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem; then, $y^{*}$ is in the convex hull of optimal solutions for the $(\mathrm{DkS})$ problem.

On one hand, according to Definition 2, it is obviously that the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem is equivalent to the $(\mathrm{DkS})$ problem. On the other hand, in view of the definition of convex cone, ${\mathbb{C}}_{1+n}$ is a closed convex cone, and is called completely positive matrices cone. Thus, the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem is convex. However, since checking whether or not a given matrix belongs to ${\mathbb{C}}_{1+n}$ is NP-hard, which has been shown by Dickinson and Gijen in [21], the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem is still NP-hard. Thus, ${\mathbb{C}}_{1+n}$ has to be replaced or approximated by some computable cones. For example, ${\mathbb{R}}_n^{+}$ and ${\mathbb{S}}_n^{+}$ are both computable cones; furthermore, ${\mathbb{N}}_n^{+}$ is also a computable cone.

It is worth mentioning that Diananda’s decomposition theorem [22] can be reformulated as follows, and its proof can be found in it.

Theorem 2.

${\mathbb{C}}_n\subseteq {\mathbb{S}}_n^{+}\cap {\mathbb{N}}_n^{+}$ holds for all n. If $n\le 4$, then ${\mathbb{C}}_n={\mathbb{S}}_n^{+}\cap {\mathbb{N}}_n^{+}$.

The matrices cone ${\mathbb{S}}_n^{+}\cap {\mathbb{N}}_n^{+}$ is sometimes called “doubly nonnegative matrices cone”. Of course, in dimension $n\ge 5$, there are matrices which are doubly nonnegative but not completely positive, the counterexample can be seen in [23].

By using Theorem 2, the $({\mathrm{CPP}}_{\mathrm{DkS}})$ problem can be relaxed to the problem

$$({\mathrm{DNNP}}_{\mathrm{DkS}})\begin{array}{cc}max\hfill & \frac{1}{2}A•Y,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & y^{T}e=k,\hfill \\ & e^{T}Ye=k^2,\hfill \\ & \mathrm{diag}(Y)=y,\hfill \\ & \left[\begin{array}{cc}1& y^T\\ y& Y\end{array}\right]\in {\mathbb{S}}_{1+n}^{+}\cap {\mathbb{N}}_{1+n}^{+},\hfill \end{array}$$

which is called the doubly nonnegative relaxation for the (DkS) problem. Some explanations are given below for this relaxation problem.

Remark 1.

Obviously, the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem has a linear objective function and the linear constraints as well as a convex conic constraint, so it is a linear conic programming problem. Meanwhile, it is notable that ${\mathbb{S}}_{1+n}^{+}\cap {\mathbb{N}}_{1+n}^{+}\subseteq {\mathbb{S}}_{1+n}^{+}$ and the types of variables in both the sets are the same, which further implies that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem could be solved by some popular package softwares for solving semidefinite programs.

2.2. New Semidefinite Relaxation

It is well-known that semidefinite relaxation is a powerful approximation technique for solving a host of combinatorial optimization problems. In this subsection, we present a new semidefinite relaxation with tighter bound for the (DkS) problem.

The idea of the standard lifting is to introduce the symmetric matrix of rank one $Y=y{y}^T$. With the help of Y, we could express the integer constraints $y_i\in \{0,1\}$ as $Y_{ii}=y_i$, and the quadratic objective function $y^{T}Ay$ as $A•Y$. Thus, we can get the following equivalent formulation of the (DkS) problem

$$\begin{array}{cc}max\hfill & \frac{1}{2}A•Y,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & y^{T}e=k,\hfill \\ & e^{T}Ye=k^2,\hfill \\ & Y=y{y}^T,\hfill \\ & \mathrm{diag}(Y)=y,\hfill \\ & \mathrm{rank}(Y)=1.\hfill \end{array}$$

Notice then that the hard constraint in the above problem is the constraint $\mathrm{rank}(Y)=1$, which is moreover difficult to handle. Thus, we can relax the above problem to the following standard semidefinite relaxation problem by dropping the rank-one constraint

$$(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})\begin{array}{cc}max\hfill & \frac{1}{2}A•Y,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & y^{T}e=k,\hfill \\ & e^{T}Ye=k^2,\hfill \\ & \mathrm{diag}(Y)=y,\hfill \\ & \left[\begin{array}{cc}1& y^T\\ y& Y\end{array}\right]\in {\mathbb{S}}_{1+n}^{+}.\hfill \end{array}$$

For the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, some remarks are given below.

Remark 2.

(i) Obviously, the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is also a linear conic programming problem, it has the same objective function and the equality constraints with the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem. The only difference between the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem and the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem has $\frac{n(n+1)}{2}+n$ nonnegative constraints more than the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem.

(ii) Since ${\mathbb{S}}_{1+n}^{+}\cap {\mathbb{N}}_{1+n}^{+}\subseteq {\mathbb{S}}_{1+n}^{+}$, it holds that $\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})\le \mathrm{Opt}(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ from Remark 2 (i). Thus, the bound of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is not larger than the one of the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem. In Section 5, we implement some numerical experiments to show the comparison between the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem and the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem from the computational point of view.

Note that the (DkS) problem is inhomogeneous, but we can homogenize it as follows. First, let $z=2y-e$ in the (DkS) problem, it follows that $z\in {\{-1,1\}}^n$. Thus, the change of variable $y\to z$ gives the following equivalent formulation of the (DkS) problem:

$$\widehat{(\mathrm{DkS})}\begin{array}{cc}max\hfill & \frac{1}{8}{z}^{T}Az+\frac{1}{4}{z}^{T}Ae+\frac{1}{8}{e}^{T}Ae,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & z^{T}e=2k-n,\hfill \\ & z\in {\{-1,1\}}^n.\hfill \end{array}$$

Then, with the introduction of the extra variable t, the (DkS) problem can be expressed as a homogeneous problem

$$\overline{(\mathrm{DkS})}\begin{array}{cc}max\hfill & \left[\begin{array}{cc}t& z^T\end{array}\right]\left[\begin{array}{cc}\frac{1}{8}{e}^{T}Ae& \frac{1}{8}{e}^{T}A\\ \frac{1}{8}Ae& \frac{1}{8}A\end{array}\right]\left[\begin{array}{c}t\\ z\end{array}\right],\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & \left[\begin{array}{cc}t& z^T\end{array}\right]\left[\begin{array}{cc}0& \frac{1}{2}{e}^T\\ \frac{1}{2}e& \mathbf{0}\end{array}\right]\left[\begin{array}{c}t\\ z\end{array}\right]=2k-n,\hfill \\ & \left[\begin{array}{c}t\\ z\end{array}\right]\in {\{-1,1\}}^{1+n},\hfill \end{array}$$

where $\mathbf{0}$ is a zero matrix with appropriate dimension.

Remark 3.

The $\overline{(\mathrm{DkS})}$ problem is equivalent to the $\widehat{(\mathrm{DkS})}$ problem in the following sense: if $\left[\begin{array}{c}{t}^{*}\\ z^{*}\end{array}\right]$ is an optimal solution to the $\overline{(\mathrm{DkS})}$ problem, then $z^{*}$ (resp. $-z^{*}$) is an optimal solution to the $\widehat{(\mathrm{DkS})}$ problem with $t^{*}=1$ (resp. $t^{*}=-1$).

By using the standard semidefinite relaxation technique, and letting let $S=\left[\begin{array}{c}t\\ z\end{array}\right]\left[\begin{array}{cc}t& z^T\end{array}\right]$, the $\overline{(\mathrm{DkS})}$ problem can be relaxed to the following problem:

$$({\mathrm{SDR}}_{\overline{\mathrm{DkS}}})\begin{array}{cc}max\hfill & \left[\begin{array}{cc}\frac{1}{8}{e}^{T}Ae& \frac{1}{8}{e}^{T}A\\ \frac{1}{8}Ae& \frac{1}{8}A\end{array}\right]•S,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & \left[\begin{array}{cc}0& \frac{1}{2}{e}^T\\ \frac{1}{2}e& \mathbf{0}\end{array}\right]•S=2k-n,\hfill \\ & \mathrm{diag}(S)=e,\hfill \\ & S\in {\mathbb{S}}_{1+n}^{+}.\hfill \end{array}$$

Moreover, again by using the standard semidefinite relaxation technique directly to the $\widehat{(\mathrm{DkS})}$ problem, we have from $Z=z{z}^T$,

$$({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})\begin{array}{cc}max\hfill & \frac{1}{8}A•Z+\frac{1}{4}{z}^{T}Ae+\frac{1}{8}{e}^{T}Ae,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & z^{T}e=2k-n,\hfill \\ & e^{T}Ze={(2k-n)}^2,\hfill \\ & \mathrm{diag}(Z)=e,\hfill \\ & \left[\begin{array}{cc}1\hfill & z^T\hfill \\ z\hfill & Z\hfill \end{array}\right]\in {\mathbb{S}}_{1+n}^{+}.\hfill \end{array}$$

The $({\mathrm{SDR}}_{\overline{\mathrm{DkS}}})$ problem and the $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problem are both standard semidefinite relaxation problems for the (DkS) problem. The upshot of the formulations of these two relaxation problems is that they can be solved very conveniently and efficiently, to some arbitrary accuracy, by some readily available software packages, such as CVX. Note that there is only one difference between these two relaxation problems, i.e., the $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problem has one equality constraint more than the $({\mathrm{SDR}}_{\overline{\mathrm{DkS}}})$ problem. In Section 5, some comparative numerical results are reported to show the effectiveness of these two relaxations problems for solving some random (DkS) problems, respectively.

It is worth noting that the constraint $z\in {\{-1,+1\}}^n$ in the $\widehat{(\mathrm{DkS})}$ problem further implies

$$(1+z_i)(1+z_j)\ge 0\Rightarrow 1+z_i+z_j+Z_{ij}\ge 0,\forall 1\le i\le j\le n$$

(1)

always holds. Thus, adding Formula (1) to the (${\mathrm{SDR}}_{\widehat{\mathrm{DkS}}}$) problem, we come up with the following new semidefinite relaxation problem

$$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})\begin{array}{cc}max\hfill & \frac{1}{8}A•Z+\frac{1}{4}{z}^{T}Ae+\frac{1}{8}{e}^{T}Ae,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & z^{T}e=2k-n,\hfill \\ & e^{T}Ze={(2k-n)}^2,\hfill \\ & \mathrm{diag}(Z)=e,\hfill \\ & 1+z_i+z_j+Z_{jj}\ge 0,\forall 1\le i\le j\le n,\hfill \\ & \left[\begin{array}{cc}1\hfill & z^T\hfill \\ z\hfill & Z\hfill \end{array}\right]\in {\mathbb{S}}_{1+n}^{+}.\hfill \end{array}$$

Obviously, the relationship $\mathrm{Opt}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})\le \mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ holds since the feasible set of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is the subset of the feasible set of the $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problem and the two problems have the same objective function.

Up to now, three new semidefinite relaxation problems for the (DkS) problem are established, i.e., the $({\mathrm{SDR}}_{\overline{\mathrm{DkS}}})$ problem, the (${\mathrm{SDR}}_{\widehat{\mathrm{DkS}}}$) problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, in which the upper bound of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is more promising than the one of the (${\mathrm{SDR}}_{\widehat{\mathrm{DkS}}}$) problem. In the following sections, we will further investigate the relationship between these three problems with the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem.

3. The Equivalence between the Relaxation Problems

The previous section establishes the doubly nonnegative relaxation (i.e., the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem) and the semidefinite relaxation with tighter bound (i.e., the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem) for the (DkS) problem. Note that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem has n inequality constraints more than the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem. In this section, we will prove the equivalence between the two relaxations. First of all, the definition of the equivalence of two optimization problems is given as follows.

Definition 2.

Two problems P1 and P2 are called equivalent if they satisfy the following two conditions:

(i) $\mathrm{Opt}(\mathrm{P}1)=\mathrm{Opt}(\mathrm{P}2)$.

(ii) If from a solution of P1, then a solution of P2 is readily found, and vice versa.

In order to establish the equivalence for the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, a crucial theorem is given below and the details of its proof can be seen in [24] (Appendix A.5.5).

Theorem 3 (Schur Complement).

Let matrix $M\in {\mathbb{S}}^n$ is partitioned as

$$M=\left[\begin{array}{cc}D\hfill & B\hfill \\ B^T\hfill & C\hfill \end{array}\right].$$

If $\det D\ne 0$, the matrix $H=C-B^T{D}^{-1}B$ is called the Schur complement of D in M. Then, the following relations hold:

(i) $M\succ \mathbf{0}$ if and only if $D\succ \mathbf{0}$ and $H\succ \mathbf{0}$.

(ii) If $D\succ \mathbf{0}$, then $M⪰\mathbf{0}$ if and only if $H⪰\mathbf{0}$.

To the end, by using Definition 2 and Theorem 3, we have the following main equivalence theorem.

Theorem 4.

Suppose that the feasible sets $\mathrm{Fea}({\mathrm{DNNP}}_{\mathrm{DkS}})$ and $\mathrm{Fea}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ are both nonempty. Then, the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem are equivalent.

Proof. 

First of all, we prove that $\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})\ge \mathrm{Opt}((\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}}))$.

Suppose that $(z^{*},Z^{*})$ is an optimal solution of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, and let

$$Y=\frac{1}{4}(e{e}^T+e{(z^{*})}^T+z^{*}{e}^T+Z^{*}),y=\frac{1}{2}(e+z^{*}).$$

(2)

Directly from $e^T{z}^{*}=2k-n$ and Equation (2), we have

$$y^{T}e=\frac{1}{2}{(e+z^{*})}^{T}e=\frac{1}{2}(n+e^T{z}^{*})=k.$$

(3)

By Equation (2) and $e^T{Z}^{*}e={(2k-n)}^2$, it holds that

$$\begin{array}{cc}{e}^{T}Ye\hfill & =\frac{1}{4}{e}^T(e{e}^T+e{(z^{*})}^T+(z^{*})e^T+Z^{*})e\hfill \\ & =\frac{1}{4}(n^2+2n{(z^{*})}^{T}e+{(2k-n)}^2)\hfill \\ & =k^2.\hfill \end{array}$$

(4)

Since $\mathrm{diag}(Z^{*})=e$, Equation (2) further implies that

$$\mathrm{diag}(Y)=\frac{1}{4}(e+2z^{*}+\mathrm{diag}(Z^{*})=\frac{1}{2}(e+z^{*})=y.$$

(5)

From $1+z_i^{*}+z_j^{*}+Z_{ij}^{*}\ge 0$ for all $1\le i\le j\le n$, it holds that

$$Y_{ij}\ge 0,\forall 1\le i\le j\le n.$$

(6)

Combining with Equation (5), it is true that from Formula (6)

$$y_i\ge 0,\forall 1\le i\le n.$$

(7)

By Theorem 3 (ii) and Equation (2), it follows that

$$\begin{array}{cc}Y-y{y}^T\hfill & =\frac{1}{4}(e{e}^T+e{(z^{*})}^T+z^{*}{e}^T+Z^{*})-\frac{1}{4}(e+z^{*}){(e+z^{*})}^T\hfill \\ & =\frac{1}{4}(Z^{*}-z^{*}{(z^{*})}^T)⪰0,\hfill \end{array}$$

i.e.,

$$\left[\begin{array}{cc}1& y^T\\ y& Y\end{array}\right]\in {\mathbb{S}}_{1+n}^{+}.$$

(8)

From Equations (3), (4) and (6)–(8), we have $(y,Y)$ defined by Equation (2) is a feasible solution of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem. Moreover, again from Equation (2), we obtain

$$\begin{array}{cc}\frac{1}{2}A•Y\hfill & =\frac{1}{8}A•(e{e}^T+e{(z^{*})}^T+z^{*}{e}^T+Z^{*})\hfill \\ & =\frac{1}{8}A•Z^{*}+\frac{1}{4}{(z^{*})}^{T}Ae+\frac{1}{8}{e}^{T}Ae\hfill \\ & =\mathrm{Opt}((\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})),\hfill \end{array}$$

i.e., $\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})\ge \mathrm{Opt}((\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}}))$.

Conversely, given an optimal solution $(y^{*},Y^{*})$ to the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem, and let

$$Z_{ij}=1-2y_i^{*}-2y_j^{*}+4Y_{ij}^{*},z_i=2y_i^{*}-1,\forall 1\le i\le j\le n.$$

(9)

Since $\mathrm{diag}(Y^{*})=y^{*}$, Equation (9) further implies that

$$\mathrm{diag}(Z)=e-4y^{*}+4\mathrm{diag}(Y^{*})=e.$$

(10)

Moreover,

$$\begin{array}{cc}1+z_i+z_j+Z_{ij}\hfill & =1+(2y_i^{*}-1)+(2y_j^{*}-1)+1-2y_i^{*}-2y_j^{*}+4Y_{ij}^{*}\hfill \\ & =4Y_{ij}^{*}\ge 0,\forall 1\le i\le j\le n.\hfill \end{array}$$

(11)

From Equation (9) and $e^T{y}^{*}=k$, it follows that

$$z^{T}e={(2y^{*}-e)}^{T}e=2{(y^{*})}^{T}e-n=2k-n.$$

(12)

Again from Equation (9) and $e^T{Y}^{*}e=k^2$, it is true that

$$\begin{array}{cc}{e}^{T}Ze\hfill & =e^T(e{e}^T-2e{(y^{*})}^T-2y^{*}{e}^T+4Y^{*})e\hfill \\ & =n^2-4kn+4k^2={(2k-n)}^2.\hfill \end{array}$$

(13)

From Equation (9) and Theorem 3 (ii), it holds that

$$\begin{array}{cc}Z-z{z}^T\hfill & =e{e}^T-2e{(y^{*})}^T-2y^{*}{e}^T+4Y^{*}-(2y^{*}-e){(2y^{*}-e)}^T\hfill \\ & =4(Y^{*}-y^{*}{(y^{*})}^T)⪰0.\hfill \end{array}$$

(14)

By Equations (11)–(14), we can conclude that $(z,Z)$ defined by Equation (9) is a feasible solution of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem. Furthermore, we have

$$\begin{array}{cc}\frac{1}{8}A•Z\hfill & +\frac{1}{4}{z}^{T}Ae+\frac{1}{8}{e}^{T}Ae\hfill \\ & =\frac{1}{8}A•(e{e}^T-2e{(y^{*})}^T-2y^{*}{e}^T+4Y^{*})+\frac{1}{4}{(2y^{*}-e)}^{T}Ae+\frac{1}{8}{e}^{T}Ae\hfill \\ & =\frac{1}{2}A•Y^{*}=\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}}),\hfill \end{array}$$

i.e., $\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})\le \mathrm{Opt}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$.

Summarizing the analysis above, we obtain $\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})=\mathrm{Opt}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$. From Equations (2) and (9), we observe that $(y,Y)$ defined by Equation (2) is an optimal solution for the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and $(z,Z)$ defined by Equation (9) is also an optimal solution for the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, respectively. According to Definition 2, we conclude that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem are equivalent. ☐

The above Theorem 4 shows that $\mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})=\mathrm{Opt}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$. Note that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem has n inequality constraints more than the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, thus the computational cost of solving $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem may be greater than that of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem.

4. The Approximation Accuracy

The above section shows that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is equivalent to the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem which has the tighter upper bound compared to the $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problem (see Theorem 4). In this section, we further investigate the approximation accuracy of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem for solving the (DkS) problem, comparing with the standard semidefinite relaxation problems which was proposed in the above sections, under some conditions.

To simplify the expression, we denote $\left[\begin{array}{cc}\frac{1}{8}{e}^{T}Ae& \frac{1}{8}{e}^{T}A\\ \frac{1}{8}Ae& \frac{1}{8}A\end{array}\right]$ by N. First of all, note that, if $k=\frac{n}{2}$, then the $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problem is simplified to the following problem:

$$\tilde{({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})}\begin{array}{cc}max\hfill & N•\left[\begin{array}{cc}1\hfill & z^T\hfill \\ z\hfill & Z\hfill \end{array}\right],\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & \mathrm{diag}(Z)=e,\hfill \\ & \left[\begin{array}{cc}1\hfill & z^T\hfill \\ z\hfill & Z\hfill \end{array}\right]\in {\mathbb{S}}_{1+n}^{+},\hfill \end{array}$$

and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem can be simplified as follows:

$$\widetilde{(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})}\begin{array}{cc}max\hfill & N•\left[\begin{array}{cc}1\hfill & z^T\hfill \\ z\hfill & Z\hfill \end{array}\right],\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & \mathrm{diag}(Z)=e,\hfill \\ & 1+z_i+z_j+Z_{ij}\ge 0,\forall 1\le i\le j\le n,\hfill \\ & \left[\begin{array}{cc}1\hfill & z^T\hfill \\ z\hfill & Z\hfill \end{array}\right]\in {\mathbb{S}}_{1+n}^{+}.\hfill \end{array}$$

Combining Theorem 3 in [25] with the corresponding known approximation accuracy of semidefinite relaxation for some quadratic programming problems [26], we immediately have that the following theorem holds.

Theorem 5.

If $k=\frac{n}{2}$, then we have

$$\frac{2}{\pi }\mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})=\frac{2}{\pi }\mathrm{Opt}(\tilde{{\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})}\le \mathrm{Opt}(\mathrm{DkS})=\mathrm{Opt}(\widehat{\mathrm{DkS}})\le \mathrm{Opt}(\tilde{{\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})}=\mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$$

and

$$\frac{2}{\pi }\mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})\le \mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})=\mathrm{Opt}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})=\mathrm{Opt}\widetilde{(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})}\le \mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$$

for $N⪰0$. Moreover, if $N⪰0$ and $N_{ij}\le 0,\forall i\ne j$, we further have

$$0.87856\mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})\le \mathrm{Opt}(\mathrm{DkS})=\mathrm{Opt}(\widehat{\mathrm{DkS}})\le \mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$$

and

$$0.87856\mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})\le \mathrm{Opt}({\mathrm{DNNP}}_{\mathrm{DkS}})=\mathrm{Opt}(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})\le \mathrm{Opt}({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$$

hold.

In the following analysis, we assume that $k\ne \frac{n}{2}$. We first observe that

$$\mathrm{Opt}(\mathrm{DkS})=\mathrm{Opt}(\overline{\mathrm{DkS}}),$$

since the $(\overline{\mathrm{DkS}})$ problem is the homogeneous problem for the $(\mathrm{DkS})$ problem. In addition, note that the constraint $\left[\begin{array}{c}t\\ z\end{array}\right]\in {\{-1,1\}}^{1+n}$ in the $(\overline{\mathrm{DkS}})$ problem can be relaxed to the quadratic form $\left[\begin{array}{cc}t& z^T\end{array}\right]\left[\begin{array}{c}t\\ z\end{array}\right]=n+1$. Thus, the $(\overline{\mathrm{DkS}})$ problem can be relaxed to

$$\widetilde{(\mathrm{DkS})}\begin{array}{cc}max\hfill & \left[\begin{array}{cc}t& z^T\end{array}\right]\left[\begin{array}{cc}\frac{1}{8}{e}^{T}Ae& \frac{1}{8}{e}^{T}A\\ \frac{1}{8}Ae& \frac{1}{8}A\end{array}\right]\left[\begin{array}{c}t\\ z\end{array}\right],\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & \left[\begin{array}{cc}t& z^T\end{array}\right]\left[\begin{array}{cc}0& \frac{1}{2}{e}^T\\ \frac{1}{2}e& \mathbf{0}\end{array}\right]\left[\begin{array}{c}t\\ z\end{array}\right]=2k-n,\hfill \\ & \left[\begin{array}{cc}t& z^T\end{array}\right]\left[\begin{array}{c}t\\ z\end{array}\right]=n+1,\hfill \end{array}$$

which can further be relaxed to the standard semidefinite programming problem

$$({\mathrm{SDR}}_{\widetilde{\mathrm{DkS}}})\begin{array}{cc}max\hfill & \left[\begin{array}{cc}\frac{1}{8}{e}^{T}Ae& \frac{1}{8}{e}^{T}A\\ \frac{1}{8}Ae& \frac{1}{8}A\end{array}\right]•S,\hfill \\ \mathrm{s}.\mathrm{t}.\hfill & \left[\begin{array}{cc}0& \frac{1}{2}{e}^T\\ \frac{1}{2}e& \mathbf{0}\end{array}\right]•S=2k-n,\hfill \\ & \mathrm{I}•S=n+1,\hfill \\ & S\in {\mathbb{S}}_{1+n}^{+}.\hfill \end{array}$$

Obviously, $\mathrm{diag}(S)=e$ implies that $\sum _i{S}_{ii}=n+1$, i.e., $\mathrm{I}•S=n+1$, but we could not obtain $\mathrm{diag}(S)=e$ from $\mathrm{I}•S=n+1$. These results further imply that

$$\mathrm{Opt}({\mathrm{SDR}}_{\overline{\mathrm{DkS}}})\le \mathrm{Opt}({\mathrm{SDR}}_{\widetilde{\mathrm{DkS}}}).$$

Similar to the Theorem 4.2 in [27], we have that the following approximation accuracy theorem holds.

Theorem 6.

$\mathrm{Opt}(\mathrm{DkS})\le \mathrm{Opt}\widetilde{(\mathrm{DkS})}\le \mathrm{Opt}({\mathrm{SDR}}_{\widetilde{\mathrm{DkS}}})\le 2\log (67)\mathrm{Opt}\widetilde{(\mathrm{DkS})}$.

Up to now, we not only establish the equivalence between the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, but also some approximation accuracy results about the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and some standard semidefinite relaxation problems are given. In the following Section 5, we will implement some numerical experiments to give a flavour of the actual behaviour of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and some semidefinite relaxation problems.

5. Numerical Experiments

In this section, some random (DkS) examples are tested to show the efficiency of the proposed relaxation problems. These relaxation problems are all solved by CVX [28], which is implemented by using MATLAB R2010a on the Windows XP platform, and on a PC with 2.53 GHz CPU. The corresponding comparative numerical results are reported in the following parts.

To give a flavour of the behaviour of the above relaxation problems, we consider results for the following test examples. The data of the test examples are given in

Table 1. Data of the test examples.

P25	n = 25;	k = 5;	seed = 1, 2, …, 50; rand(‘seed’,seed);
			A = round(10 × rand(n)); A = tril(A,−1) + triu(A’,0);
P30	$n=$ 30;	$k=$ 10;	seed = 2012; randn(‘seed’,seed); A = randn($n,n$);
			A = tril(A,−1) + triu(A’,0);
P40	$n=$ 40;	$k=$ 15;	seed = 2017; rand(‘seed’,seed); A = rand($n,n$);
			A = tril(A,−1) + triu(A’,0);
P50	$n=$ 50;	$k=$ 10;	seed = 2001, 2002, …, 2050; rand(‘seed’,seed);
			G = (rand(n)<0.5); A = round(20 × rand(n)−10); A = triu(A,1);
			A = A.*G; A100 = A + A’;
P60	$n=$ 60;	$k=$ 20;	seed = 2020; rand(‘seed’,seed); A = round(rand($n,n$));
			A = tril(A,−1) + triu(A’,0);
P80	$n=$ 80;	$k=$ 30;	seed = 2023; rand(‘seed’,seed); A = round(rand($n,n$));
			A = tril(A,−1) + triu(A’,0);

.

The first column of Table 1 denotes the name of the test examples, n and k stand for the number of vertices of the given graph and the finding subgraph, respectively. The last column denotes the procedures for generating the coefficient matrices A in the (DkS) problem. The more detailed explanations for the procedures are given as follows:

• P25. 50 random examples are generated from the ‘seed = 1,2,…,50’. The corresponding coefficient matrices A of order $n=25$ with integer weights are drawn from $\{0,1,\dots ,10\}$.

• P30. This example is generated by the MATLAB function randn from the ‘seed = 2012’. The elements of A satisfy the standard normal distribution.

• P40. This example is generated by MATLAB function rand from the ‘seed = 2017’. The elements of A satisfy the standard uniform distribution on the interval $(0,1)$.

• P50. We generate 50 examples of order $n=50$ from the ‘seed = 2001,2002,…,2050’. For each coefficient matrix of these examples, half of the entries are randomly set to zero, and the remaining ones are chosen from $\{-10,-9,\dots ,9,10\}$.

• P60. This example is generated by MATLAB function rand from the ‘seed = 2020’. The elements of A are drawn from $\{0,1\}$.

• P80. This example is generated by MATLAB function rand from the ‘seed = 2023’. The coefficient matrix A of order $n=80$ with integer weights drawn from $\{0,1,\dots ,10\}$.

First of all, the performances of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-S{\mathrm{DR}}_{\mathrm{DkS}})$ problem as well as the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, for solving P25 and P50, are compared. We use the performance profiles described in Dolan and Moré’s paper [29]. Our profiles are based on optimal values (i.e., average degree) and the number of iterations of these relaxation problems. The Cumulative Probability denotes the cumulative distribution function for the performance ratio within a factor $\tau \in R$, i.e., is the probability that the solver will win over the rest of the solvers. The corresponding comparative results of performance are shown in Figure 1 and Figure 2.

The comparative results for P25 are shown in Figure 1. It is obvious that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem have the same performance, which is a bit better than that of the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem from the viewpoint of optimal values. In view of the number of iterations, the performance of the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is the best, and the performance of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is better than that of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem.

The performance of the three relaxation problems for solving P50 is shown in Figure 2. The results show that the performance of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is the same as that of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem; they are both much better than that of the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem in view of optimal values—although the performance of the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is better than the one of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem from the viewpoint of the number of iterations.

All of results show in Figure 1 and Figure 2 further imply that the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem can generate more promising bounds for solving P25 and P50, compared with the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem, while the number of iterations is a bit more. Moreover, the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem have the same performance based on optimal values, although the performance of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem is better than that of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem from the viewpoint of the number of iterations, for solving P25 and P50.

In order to further show the computational efficiency of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem, which is compared with the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem and some other types of semidefinite relaxation problems proposed in [30], for solving some (DkS) problems. The test examples A50 and A100 are chosen from [30]. (R-20), (R-24) and (R-MET) denote the three semidefinite relaxation problems proposed in [30], respectively. The corresponding numerical results are shown in

Table 2. Numerical results for some DkS examples in [30].

Example	Solving Model	Optimal Value	Number of Iterations
A50	$({\mathrm{DNNP}}_{\mathrm{DkS}})$	$337.4$	51
	$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$337.416$	57
	$(\mathrm{R}-20)$	$365.508$	−
	$(\mathrm{R}-24)$	$365.831$	−
	$(\mathrm{R}-\mathrm{MET})$	$333.65$	−
A100	$({\mathrm{DNNP}}_{\mathrm{DkS}})$	$505.989$	54
	$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$506.126$	68
	$(\mathrm{R}-20)$	$607.691$	−
	$(\mathrm{R}-24)$	$611.070$	−
	$(\mathrm{R}-\mathrm{MET})$	$490.50$	−

, where “−” means that the corresponding information about the number of iterations is not given in [30]. The results show that the computational efficiency of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is better than the one of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem from the viewpoints of optimal values and number of iterations, respectively. Note that the performance of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem and the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem are both much better than that of $(\mathrm{R}-20)$ and $(\mathrm{R}-24)$. Moreover, the performance of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is more competitive with $(\mathrm{R}-\mathrm{MET})$ for solving these two problems.

Finally, we further compare the efficiency of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$, $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$, $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ and $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problems, for solving examples P30, P40, P60 and P80. The comparative results are shown in

Table 3. Numerical results for some (DkS) examples.

Example	Solving Model	Optimal Value	Number of Iterations	CPU Time (seconds)
P30	$({\mathrm{DNNP}}_{\mathrm{DkS}})$	$30.5894$	52	$3.4$
	$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$30.5903$	70	$5.0$
	$(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$33.3382$	33	$0.7$
	$({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$	$33.3383$	34	$0.8$
P40	$({\mathrm{DNNP}}_{\mathrm{DkS}})$	$74.4657$	50	$14.7$
	$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$74.4658$	66	$20.6$
	$(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$75.5198$	33	$1.5$
	$({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$	$75.5197$	34	$1.6$
P60	$({\mathrm{DNNP}}_{\mathrm{DkS}})$	$150.385$	52	$105.5$
	$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$150.387$	60	$125.3$
	$(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$154.272$	40	$3.2$
	$({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$	$154.273$	35	$2.2$
P80	$({\mathrm{DNNP}}_{\mathrm{DkS}})$	$230.912$	84	$739.9$
	$(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$312.644$	85	$770.4$
	$(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$	$318.945$	41	$5.7$
	$({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$	$318.945$	34	$3.2$

. The results signify that the efficiency of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem is always better than that of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem from the viewpoint of optimal values and the number of iterations as well as CPU time, respectively, for solving these examples. The performance of the $(\mathrm{I}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem and the $({\mathrm{SDR}}_{\widehat{\mathrm{DkS}}})$ problem are almost the same for solving these examples. Moreover, note that the optimal value of the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem for solving P80 is larger than that of the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem. Thus, we can conclude that it may be more promising to use the $({\mathrm{DNNP}}_{\mathrm{DkS}})$ problem than to use the $(\mathrm{II}-{\mathrm{SDR}}_{\mathrm{DkS}})$ problem for solving some specific (DkS) problems in practice.

6. Conclusions

In this paper, the DkS problem is studied, whose goal is to find a k-vertex subgraph such that the total weight of edges in this subgraph is maximized. This problem is NP-hard on bipartite graphs, chordal graphs, and planar graphs. By using the advantages of the structure of the DkS problem, the doubly nonnegative relaxation and the new semidefinite relaxation with tighter relaxation for solving the DkS problem are established, respectively. Moreover, we prove that the two relaxation problems are equivalent under the suitable conditions, and give some approximation accuracy results for these relaxation problems. Finally, the comparative numerical results show that the efficiency of the doubly nonnegative relaxation is better than the one of semidefinite relaxation for solving some DkS problems.