Heuristic Algorithm for Signed Domination Number of a Graph

2005 
This pagerstudiesalgorithmsfordeterminingthesigneddominationnumberinagraph.Somepersonificationstrategiesoftacklingitareproposedbasedon personification, and a heuristic algorithm named Local-Search-SDN is presented. The experimental results show that the performance of Local-Search-SDN is very good in both the solution quality and the execution time.
    • Correction
    • Source
    • Cite
    • Save
    • Machine Reading By IdeaReader
    0
    References
    0
    Citations
    NaN
    KQI
    []