Pages that link to "Item:Q2837833"
From MaRDI portal
The following pages link to An improved branch and bound algorithm for the maximum clique problem (Q2837833):
Displaying 7 items.
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- (Q5155414) (← links)
- A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900316) (← links)
- A branch and bound algorithm for the maximum clique problem (Q5905591) (← links)
- An Algebra for Path Manipulation in Graph Databases (Q6487410) (← links)
- On Bruen chains (Q6615548) (← links)