Journal Articles Theoretical Computer Science Year : 2018

The many facets of upper domination

Abstract

This paper studies Upper Domination, i.e., the problem of computing the maximum cardinality of a minimal dominating set in a graph with respect to classical and parameterised complexity as well as approximability.

Dates and versions

hal-02165904 , version 1 (26-06-2019)

Identifiers

Cite

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, et al.. The many facets of upper domination. Theoretical Computer Science, 2018, 717, ⟨10.1016/j.tcs.2017.05.042⟩. ⟨hal-02165904⟩
90 View
0 Download

Altmetric

Share

More