Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6994881
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computing a minimum paired-dominating set in strongly orderable graphs |
scientific article; zbMATH DE number 6994881 |
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
0.9035879969596864
0 references
0.8764004111289978
0 references
0.8594579100608826
0 references
0.8406420946121216
0 references
0.8316266536712646
0 references
