Cookies

We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.


Durham Research Online
You are in:

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs.

Alves, Sancrey Rodrigues and Dabrowski, Konrad K. and Faria, Luerbio and Klein, Sulamita and Sau, Ignasi and dos Santos Souza, Uéverton (2016) 'On the (parameterized) complexity of recognizing well-covered (r,l)-graphs.', in Combinatorial optimization and applications : 10th International Conference, COCOA 2016, Hong Kong, China, December 16–18, 2016 ; proceedings. Cham, Switzerland: Springer, pp. 423-437. Lecture notes in computer science. (10043).

Abstract

An (r,ℓ)(r,ℓ)-partition of a graph G is a partition of its vertex set into r independent sets and ℓℓ cliques. A graph is (r,ℓ)(r,ℓ) if it admits an (r,ℓ)(r,ℓ)-partition. A graph is well-covered if every maximal independent set is also maximum. A graph is (r,ℓ)(r,ℓ)-well-covered if it is both (r,ℓ)(r,ℓ) and well-covered. In this paper we consider two different decision problems. In the (r,ℓ)(r,ℓ)-Well-Covered Graph problem ((r,ℓ)(r,ℓ) wcg for short), we are given a graph G, and the question is whether G is an (r,ℓ)(r,ℓ)-well-covered graph. In the Well-Covered (r,ℓ)(r,ℓ)-Graph problem (wc (r,ℓ)(r,ℓ) g for short), we are given an (r,ℓ)(r,ℓ)-graph G together with an (r,ℓ)(r,ℓ)-partition of V(G) into r independent sets and ℓℓ cliques, and the question is whether G is well-covered. We classify most of these problems into P, coNP-complete, NP-complete, NP-hard, or coNP-hard. Only the cases wc(r, 0)g for r≥3r≥3 remain open. In addition, we consider the parameterized complexity of these problems for several choices of parameters, such as the size αα of a maximum independent set of the input graph, its neighborhood diversity, or the number ℓℓ of cliques in an (r,ℓ)(r,ℓ)-partition. In particular, we show that the parameterized problem of deciding whether a general graph is well-covered parameterized by αα can be reduced to the wc (0,ℓ)(0,ℓ) g problem parameterized by ℓℓ, and we prove that this latter problem is in XP but does not admit polynomial kernels unless coNP⊆NP/polycoNP⊆NP/poly.

Item Type:Book chapter
Full text:(AM) Accepted Manuscript
Download PDF
(357Kb)
Status:Peer-reviewed
Publisher Web site:https://doi.org/10.1007/978-3-319-48749-6_31
Publisher statement:The final publication is available at Springer via https://doi.org/10.1007/978-3-319-48749-6_31
Date accepted:02 September 2016
Date deposited:30 November 2016
Date of first online publication:31 October 2016
Date first made open access:31 October 2017

Save or Share this output

Export:
Export
Look up in GoogleScholar