Complexity and Algorithms for Semipaired Domination in Graphs
Sign Up to like & getrecommendations! Published in 2020 at "Theory of Computing Systems"
DOI: 10.1007/s00224-020-09988-3
Abstract: For a graph G = ( V , E ) with no isolated vertices, a set D ⊆ V $D\subseteq V$ is called a semipaired dominating set of G if ( i ) D is… read more here.
Keywords: graphs; semipaired domination; minimum semipaired; dominating set ... See more keywords
Modelling and solving the perfect edge domination problem
Sign Up to like & getrecommendations! Published in 2020 at "Optimization Letters"
DOI: 10.1007/s11590-018-1335-x
Abstract: A formulation is proposed for the perfect edge domination problem and some exact algorithms based on it are designed and tested. So far, perfect edge domination has been investigated mostly in computational complexity terms. Indeed,… read more here.
Keywords: edge domination; edge; perfect edge; domination problem ... See more keywords
Heuristics for the weighted total domination problem
Sign Up to like & getrecommendations! Published in 2025 at "TOP"
DOI: 10.1007/s11750-025-00695-1
Abstract: The weighted total domination problem (WTDP) belongs to the family of dominating set problems. Given an edge- and vertex- weighted graph, the WTDP consists in selecting a total dominating set D, such that the sum… read more here.
Keywords: problem; weighted total; usepackage; domination problem ... See more keywords