Pages that link to "Item:Q1328622"
From MaRDI portal
The following pages link to A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622):
Displaying 8 items.
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Solving the weighted efficient edge domination problem on bipartite permutation graphs (Q1270782) (← links)
- Weighted efficient domination problem on some perfect graphs (Q1348388) (← links)
- A linear time algorithm for a variant of the MAX CUT problem in series parallel graphs (Q1748508) (← links)
- Weighted independent perfect domination on cocomparability graphs (Q1917231) (← links)
- The weighted perfect domination problem and its variants (Q1917310) (← links)
- Hereditary Efficiently Dominatable Graphs (Q5325951) (← links)
- Perfect domination and small cycles (Q5367522) (← links)
