Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts - Archive ouverte HAL Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2017

Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts

Abstract

Total dominating set, connected vertex cover and Steiner tree are well-known graph problems. Despite the fact that they are NP-complete to optimize, it is easy (even trivial) to find solutions, regardless of their size. In this paper, we study a variant of these problems by adding conflicts, that are pairs of vertices that cannot be both in a solution. This new constraint leads to situations where it is NP-complete to decide if there exists a solution avoiding conflicts. This paper proposes NP-completeness proofs of the existence of a solution for different restricted classes of graphs and conflicts, improving recent results. We also propose polynomial time constructions in several restricted cases and we introduce a new parameter, the stretch, to capture the locality of the conflicts.
Fichier principal
Vignette du fichier
main (1).pdf (433.94 Ko) Télécharger le fichier
Origin Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01455072 , version 1 (03-02-2017)
hal-01455072 , version 2 (13-09-2017)
hal-01455072 , version 3 (19-12-2017)

Identifiers

Cite

Alexis Cornet, Christian Laforest. Total Domination, Connected Vertex Cover and Steiner Tree with Conflicts. Discrete Mathematics and Theoretical Computer Science, 2017, Vol. 19 no. 3 (3), ⟨10.23638/DMTCS-19-3-17⟩. ⟨hal-01455072v3⟩
300 View
1406 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More