Pages that link to "Item:Q342100"
From MaRDI portal
The following pages link to Infra-chromatic bound for exact maximum clique search (Q342100):
Displaying 6 items.
- 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)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- A nonconvex quadratic optimization approach to the maximum edge weight clique problem (Q1756769) (← links)