Locating switches

Landete, Mercedes; Marı́n, Alfredo; Sainz-Pardo, José L.

doi:10.1016/j.eswa.2019.06.054

Search citation statements

Order By: Relevance

Paper Sections

Select...

Block Decomposition Algorithm1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2022

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several similar decomposition mechanisms have been described in the literature for other graph problems, see, for example, Refs. [21,22].…”

Section: Block Decomposition Algorithmmentioning

confidence: 99%

The Domatic Partition Problem in Separable Graphs

Landete

Sainz-Pardo

2022

Mathematics

Self Cite

View full text Add to dashboard Cite

The domatic partition problem consists of partitioning a given graph into a maximum number of disjoint dominating sets. This problem is related with the domatic number problem, which consists of quantifying this maximum number of disjoint dominating sets. Both problems were proved to be NP-complete. In this paper, we present a decomposition algorithm for finding a domatic partition on separable graphs, that is, on graphs with blocks, and as a consequence, its domatic number, highly reducing the computational complexity. Computational results illustrate the benefits of the block decomposition algorithm.

show abstract

“…Several similar decomposition mechanisms have been described in the literature for other graph problems, see, for example, Refs. [21,22].…”

Section: Block Decomposition Algorithmmentioning

confidence: 99%