Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 03:45, 1 February 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
