The following pages link to (Q4558957):
Displaying 5 items.
- Maximum balanced subgraph problem parameterized above lower bound (Q391973) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- An improved kernel for max-bisection above tight lower bound (Q1985605) (← links)
- Partitions and well-coveredness: the graph sandwich problem (Q2111912) (← links)
- On the complexity of coloring ‐graphs (Q6092550) (← links)