Pages that link to "Item:Q912630"
From MaRDI portal
The following pages link to The weighted perfect domination problem (Q912630):
Displayed 10 items.
- 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)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)