Pages that link to "Item:Q868636"
From MaRDI portal
The following pages link to An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636):
Displaying 8 items.
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs (Q5154765) (← links)
- A New Branch and Bound Algorithm for the Clique Partitioning Problem (Q5392092) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900316) (← links)
- Certified dominance and symmetry breaking for combinatorial optimisation (Q6488808) (← links)
- Reformulations and complexity of the clique interdiction problem by graph mapping (Q6558672) (← links)