Pages that link to "Item:Q912630"
From MaRDI portal
The following pages link to The weighted perfect domination problem (Q912630):
Displayed 21 items.
- \((1, j)\)-set problem in graphs (Q294556) (← links)
- Structure of squares and efficient domination in graph classes (Q338382) (← links)
- Algorithms for unipolar and generalized split graphs (Q741738) (← links)
- A tight bound on the number of mobile servers to guarantee transferability among dominating configurations (Q972325) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Polynomial algorithms for the weighted perfect domination problems on chordal graphs and split graphs (Q1313745) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- Weighted domination of cocomparability graphs (Q1382270) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- On \([j, k]\)-sets in graphs (Q2091155) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- The \(k\)-power domination problem in weighted trees (Q2290632) (← links)
- \([1,2]\)-sets in graphs (Q2446878) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
- Equitable fair domination in graphs (Q5025163) (← links)
- A Taxonomy of Perfect Domination (Q5069690) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
- Outer complete fair domination in graphs (Q5866027) (← links)