Pages that link to "Item:Q1941191"
From MaRDI portal
The following pages link to An improved bit parallel exact maximum clique algorithm (Q1941191):
Displayed 9 items.
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- Finding near-optimal independent sets at scale (Q2401330) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- On the Power of Simple Reductions for the Maximum Independent Set Problem (Q2817877) (← links)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)