Pages that link to "Item:Q5268925"
From MaRDI portal
The following pages link to An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925):
Displaying 6 items.
- BBMCW (Q33276) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)