An iterated greedy algorithm for finding the minimum dominating set in graphs (Q6102924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Emergence of Scaling in Random Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: An order-based algorithm for minimum dominating set with application in graph mining / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3314935 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821947 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A measure & conquer approach for the analysis of exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: First vs. best improvement: an empirical study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Domination in Graphs Applied to Electric Power Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368728 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4368729 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automata, Languages and Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398780 / rank
 
Normal rank
Property / cites work
 
Property / cites work: GRASP and VNS for solving the \(p\)-next center problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3291034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scatter search for the bandpass problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental analysis of Heuristic algorithms for the dominating set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating communities for hierarchical control of complex networks / rank
 
Normal rank

Revision as of 12:16, 1 August 2024

scientific article; zbMATH DE number 7701017
Language Label Description Also known as
English
An iterated greedy algorithm for finding the minimum dominating set in graphs
scientific article; zbMATH DE number 7701017

    Statements

    An iterated greedy algorithm for finding the minimum dominating set in graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 June 2023
    0 references
    domination number
    0 references
    minimum dominating set
    0 references
    greedy heuristics
    0 references
    iterated greedy
    0 references
    exact algorithm
    0 references

    Identifiers