Pages that link to "Item:Q526419"
From MaRDI portal
The following pages link to A parallel maximum clique algorithm for large and massive sparse graphs (Q526419):
Displaying 12 items.
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- (Q2779605) (← links)
- (Q3406317) (← links)
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network (Q3627914) (← links)
- (Q4945422) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← 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)
- An enhanced bitstring encoding for exact maximum clique search in sparse graphs (Q5268925) (← links)
- Massively Parallel Correlation Clustering in Bounded Arboricity Graphs (Q6061704) (← links)