A linear-time algorithm for weighted paired-domination on block graphs

Ching-Chi Lin (), Cheng-Yu Hsieh () and Ta-Yu Mu ()
Additional contact information
Ching-Chi Lin: National Taiwan Ocean University
Cheng-Yu Hsieh: National Taiwan University
Ta-Yu Mu: National Taiwan University

Journal of Combinatorial Optimization, 2022, vol. 44, issue 1, No 13, 269-286

Abstract: Abstract In a graph $$G = (V,E)$$ G = ( V , E ) , a set $$S\subseteq V(G)$$ S ⊆ V ( G ) is said to be a dominating set of G if every vertex not in S is adjacent to a vertex in S. Let G[S] denote the subgraph of G induced by a subset S of V(G). A dominating set S of G is called a paired-dominating set of G if the induced subgraph G[S] contains a perfect matching. Suppose that, for each $$v \in V(G)$$ v ∈ V ( G ) , we have a weight w(v) specifying the cost for adding v to S. The weighted paired-domination problem is to find a paired-dominating set S whose total weights $$w(S) = \sum _{v \in S} {w(v)}$$ w ( S ) = ∑ v ∈ S w ( v ) is minimized. In this paper, we propose an $$O(n+m)$$ O ( n + m ) -time algorithm for the weighted paired-domination problem on block graphs using dynamic programming, which strengthens the results in [Theoret Comput Sci 410(47–49):5063–5071, 2009] and [J Comb Optim 19(4):457–470, 2010]. Moreover, the algorithm can be completed in O(n) time if the block-cut-vertex structure of G is given.

Keywords: Weighted paired-domination; Perfect matching; Block graph; Dynamic programming (search for similar items in EconPapers)
Date: 2022
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-021-00767-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:44:y:2022:i:1:d:10.1007_s10878-021-00767-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-021-00767-5

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().