Bounds on cost effective domination numbers (Q5236029): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2989/16073606.2016.1167133 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2506332991 / rank
 
Normal rank
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
    0 references
    0 references
    0 references
    0 references
    15 October 2019
    0 references
    cost effective sets
    0 references
    very cost effective sets
    0 references
    domination
    0 references

    Identifiers