Pages that link to "Item:Q5918935"
From MaRDI portal
The following pages link to Lower bounds for the happy coloring problems (Q5918935):
Displaying 5 items.
- Parameterized complexity of happy coloring problems (Q2192381) (← links)
- New algorithms for a simple measure of network partitioning (Q2700788) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5918330) (← links)
- Approximating max \(k\)-uncut via LP-rounding plus greed, with applications to densest \(k\)-subgraph (Q5919045) (← links)
- (Q5919450) (redirect page) (← links)
