The weighted perfect domination problem

DOI10.1016/0020-0190(90)90031-RMaRDI QIDQ912630zbMATH OpenFDO

Authors Chain-Chin Yen, R. C. T. Lee

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

treeschordal graphsNP-completebipartite graphsperfect dominationlinear algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The weighted perfect domination problem and its variants
• A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
• Weighted domination on cocomparability graphs
• Perfect edge domination and efficient edge domination in graphs

Cites work

• scientific article; zbMATH DE number 3174053 (Why is no real title available?)
• scientific article; zbMATH DE number 3859178 (Why is no real title available?)
• scientific article; zbMATH DE number 3690676 (Why is no real title available?)
• scientific article; zbMATH DE number 3747181 (Why is no real title available?)
• scientific article; zbMATH DE number 3596896 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3449757 (Why is no real title available?)
• A Dynamic Programming Approach to the Dominating Set Problem on k-Trees
• Dominating Sets in Chordal Graphs
• Dominating sets for split and bipartite graphs
• Labeling algorithms for domination problems in sun-free chordal graphs
• Optimum domination in weighted trees
• Scheduling to Minimize Interaction Cost
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• The distance-domination numbers of trees
• Towards a theory of domination in graphs

Cited in

(28)

• Structural parameterization for minimum conflict-free colouring
• The bottleneck independent domination on the classes of bipartite graphs and block graphs.
• A tight bound on the number of mobile servers to guarantee transferability among dominating configurations
• On weighted efficient total domination
• Perfect domination and small cycles
• Weighted domination of cocomparability graphs
• A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs
• Outer complete fair domination in graphs
• \((1, j)\)-set problem in graphs
• Weighted domination on cocomparability graphs
• Algorithms for unipolar and generalized split graphs
• A Taxonomy of Perfect Domination
• Structure of squares and efficient domination in graph classes
• The k-power domination problem in weighted trees
• The image of weighted combinatorial problems
• Solving the weighted efficient edge domination problem on bipartite permutation graphs
• Equitable fair domination in graphs
• Weighted efficient domination problem on some perfect graphs
• Modelling and solving the perfect edge domination problem
• A resource assignment problem on graphs
• On Hotelling's Weighing Problem
• THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
• The weighted perfect domination problem and its variants
• Weighted independent perfect domination on cocomparability graphs
• Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs
• \([1,2]\)-sets in graphs
• Reception capacity: definitions, game theory and hardness
• On \([j, k]\)-sets in graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q912630)