Pages that link to "Item:Q3447472"
From MaRDI portal
The following pages link to Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472):
Displaying 16 items.
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network (Q2159961) (← links)
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← links)
- (Q2779605) (← links)
- (Q3406317) (← links)
- Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata (Q3448629) (← links)
- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network (Q3627914) (← links)
- PARALLEL INCREMENTAL ALGORITHMS FOR ANALYZING ACTIVITY NETWORKS (Q4226502) (← links)
- (Q4945422) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Finding Cliques in Social Networks: A New Distribution-Free Model (Q5112249) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)
- Learning to sample initial solution for solving 0-1 discrete optimization problem by local search (Q6564766) (← links)