The following pages link to Wayne Pullan (Q281822):
Displaying 5 items.
- Construction of optimal constant-dimension subspace codes (Q281823) (← links)
- Approximating the maximum vertex/edge weighted clique using local search (Q1009183) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers (Q1015327) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
