Pages that link to "Item:Q4571486"
From MaRDI portal
The following pages link to Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications (Q4571486):
Displayed 4 items.
- A multiple search operator heuristic for the max-k-cut problem (Q513573) (← links)
- Conjugate conflict continuation graphs for multi-layer constrained via minimization (Q881874) (← links)
- New bounds for the \(\max\)-\(k\)-cut and chromatic number of a graph (Q896848) (← links)
- An effective iterated tabu search for the maximum bisection problem (Q1652221) (← links)
