The following pages link to (Q4945422):
Displaying 14 items.
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- An exact algorithm for the maximum clique problem (Q922964) (← links)
- A comparison of problem decomposition techniques for the FAP (Q972658) (← links)
- Risk transportation via a clique number problem formulation. (Q1412758) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Parallelization of a branch-and-bound algorithm for the maximum weight clique problem (Q2234743) (← links)
- Recognition of split-graphic sequences (Q2254547) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- (Q2779605) (← links)
- (Q3406317) (← links)
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network (Q3627914) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)