Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129097715, #quickstatements; #temporary_batch_1723710233280 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129097715 / rank | |||
Normal rank | |||
Revision as of 09:24, 15 August 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
