Pages that link to "Item:Q1297468"
From MaRDI portal
The following pages link to Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468):
Displayed 7 items.
- Pseudo-Boolean optimization (Q697569) (← links)
- On the effectiveness of immune inspired mutation operators in some discrete optimization problems (Q781286) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Walk-preserving transformation of overlapped sequence graphs into blunt sequence graphs with GetBlunted (Q2117779) (← links)
- Eigenvector-based identification of bipartite subgraphs (Q2328104) (← links)
- Judicious partitions of bounded‐degree graphs (Q4474279) (← links)
- Problems and results on judicious partitions (Q4798176) (← links)