Pages that link to "Item:Q6087212"
From MaRDI portal
The following pages link to Minimization and parameterized variants of vertex partition problems on graphs (Q6087212):
Displaying 5 items.
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem (Q337212) (← links)
- Solution of one problem of optimal partition of the vertex set of a hypergraph (Q3752416) (← links)
- A Fixed Parameter Algorithm for the Minimum Number Convex Partition Problem (Q5449757) (← links)
- Min-Max Graph Partitioning and Small Set Expansion (Q5494941) (← links)
- Complexity of near-3-choosability problem (Q6632143) (← links)