Pages that link to "Item:Q2938025"
From MaRDI portal
The following pages link to Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs (Q2938025):
Displaying 13 items.
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Solving maximum clique in sparse graphs: an \({O(nm+n2^{d/4})}\) algorithm for \(d\)-degenerate graphs (Q479213) (← links)
- 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)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- On CLIQUE Problem for Sparse Graphs of Large Dimension (Q3463541) (← 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)
- Solving larger maximum clique problems using parallel quantum annealing (Q6098277) (← links)