Bounds on cost effective domination numbers (Q5236029): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Unfriendly partitions of a graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The satisfactory partition problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Algorithmic approach to the satisfactory graph partitioning problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4820779 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q2869348 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4368728 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4405794 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3211331 / rank | |||
Normal rank |
Latest revision as of 15:43, 20 July 2024
scientific article; zbMATH DE number 7117146
Language | Label | Description | Also known as |
---|---|---|---|
English | Bounds on cost effective domination numbers |
scientific article; zbMATH DE number 7117146 |
Statements
Bounds on cost effective domination numbers (English)
0 references
15 October 2019
0 references
cost effective sets
0 references
very cost effective sets
0 references
domination
0 references