Pages that link to "Item:Q1736530"
From MaRDI portal
The following pages link to Exact algorithms for maximum clique: a computational study (Q1736530):
Displaying 34 items.
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- An exact exponential time algorithm for counting bipartite cliques (Q436594) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Evaluating the effects of the clique selection in exact graph colouring algorithms (Q659453) (← links)
- An algorithm for reporting maximal \(c\)-cliques (Q817824) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- Exact algorithms for maximum clique: a computational study (Q1736530) (← links)
- Editorial: Special issue on graph algorithms (Q1736576) (← links)
- Multi-threading a state-of-the-art maximum clique algorithm (Q1736587) (← links)
- Algebraic methods in the congested clique (Q2010605) (← links)
- Computing maximum \(k\)-defective cliques in massive graphs (Q2026994) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Dynamic node packing (Q2097666) (← links)
- An effective branch-and-bound algorithm for the maximum \(s\)-bundle problem (Q2242188) (← links)
- Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- A parallel branch and bound algorithm for the maximum labelled clique problem (Q2355318) (← links)
- Fast exact algorithms for some connectivity problems parameterized by clique-width (Q2420640) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- Parallel Maximum Clique Algorithms with Applications to Network Analysis (Q3447472) (← links)
- An Exact Algorithm for the Minimum Dominating Clique Problem (Q3499731) (← links)
- An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique (Q3627690) (← links)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- (Q4945422) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← links)
- Why Is Maximum Clique Often Easy in Practice? (Q5144801) (← links)