The weighted perfect domination problem and its variants

From MaRDI portal
Publication:1917310

DOI10.1016/0166-218X(94)00138-4zbMath0848.05042OpenAlexW2165864598MaRDI QIDQ1917310

Chain-Chin Yen, Richard Chia-Tung Lee

Publication date: 6 October 1996

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00138-4




Related Items (31)

Perfect edge domination and efficient edge domination in graphsUniformity of Point Samples in Metric Spaces Using Gap RatioA dichotomy for weighted efficient dominating sets with bounded degree verticesWeighted efficient domination problem on some perfect graphsEfficient domination through eigenvaluesStructure of squares and efficient domination in graph classesClassification of efficient dominating sets of circulant graphs of degree 5Perfect Italian domination in graphs: complexity and algorithmsON GRAPHS WITH PAIRWISE DISJOINT EFFICIENT DOMINATING SETS AND EFFICIENT DOMINATION IN TREES IN TERMS OF SUPPORT VERTICESA linear-time algorithm for weighted paired-domination on block graphsWeighted independent perfect domination on cocomparability graphsHereditary Efficiently Dominatable GraphsModelling and solving the perfect edge domination problemWeighted domination of cocomparability graphsUniformity of Point Samples in Metric Spaces Using Gap RatioEfficient minus and signed domination in graphsExtended formulations for perfect domination problems and their algorithmic implicationsk-Efficient domination: Algorithmic perspectiveWeighted efficient domination in two subclasses of \(P_6\)-free graphsOn efficiently total dominatable digraphsGeneralized perfect domination in graphsPolynomial-time algorithms for weighted efficient domination problems in AT-free graphs and dually chordal graphsEfficient domination for classes of \(P_6\)-free graphsCounting independent sets in tree convex bipartite graphsPolynomial-time algorithm for weighted efficient domination problem on diameter three planar graphsAlgorithmic results on double Roman domination in graphsWeighted efficient domination for some classes of \(H\)-free and of \((H_1, H_2)\)-free graphsOn efficient domination for some classes of \(H\)-free chordal graphsOn efficient domination for some classes of \(H\)-free chordal graphsSolving the weighted efficient edge domination problem on bipartite permutation graphsEfficient \((j, k)\)-dominating functions



Cites Work


This page was built for publication: The weighted perfect domination problem and its variants