Pages that link to "Item:Q2777604"
From MaRDI portal
The following pages link to Approximating element-weighted vertex deletion problems for the complete \(k\)-partite property (Q2777604):
Displaying 4 items.
- Combination of parallel machine scheduling and vertex cover (Q690471) (← links)
- A linear programming formulation for the maximum complete multipartite subgraph problem (Q2583129) (← links)
- The maximum edge-weighted clique problem in complete multipartite graphs (Q3983239) (← links)
- Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)