Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.dam.2018.08.022 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129097715 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.DAM.2018.08.022 / rank | |||
Normal rank | |||
Latest revision as of 00:04, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a minimum paired-dominating set in strongly orderable graphs |
scientific article |
Statements
Computing a minimum paired-dominating set in strongly orderable graphs (English)
0 references
18 December 2018
0 references
domination
0 references
paired-domination
0 references
strongly orderable graphs
0 references
polynomial time algorithm
0 references
0 references
0 references
