Computing a minimum paired-dominating set in strongly orderable graphs (Q1634760): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2018.08.022 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2897850773 / rank | |||
Normal rank | |||
Revision as of 02:42, 20 March 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
