The following pages link to (Q2837833):
Displaying 41 items.
- MaxCliqueDyn (Q20516) (← links)
- Solving the maximum vertex weight clique problem via binary quadratic programming (Q306100) (← links)
- Infra-chromatic bound for exact maximum clique search (Q342100) (← links)
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Coloring the nodes of a directed graph (Q399510) (← links)
- On risk-averse maximum weighted subgraph problems (Q405680) (← links)
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs (Q496657) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- Mathematical properties and bounds on haplotyping populations by pure parsimony (Q541881) (← links)
- An exact bit-parallel algorithm for the maximum clique problem (Q709206) (← links)
- A new table of permutation codes (Q766240) (← links)
- Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group (Q1629368) (← links)
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights (Q1640044) (← 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)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- Optimizing with minimum satisfiability (Q1761303) (← links)
- There is no (75,32,10,16) strongly regular graph (Q1790457) (← links)
- An improved bit parallel exact maximum clique algorithm (Q1941191) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← links)
- A greedy algorithm to construct covering arrays using a graph representation (Q2201668) (← links)
- Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809) (← links)
- An improved lower bound related to the Furstenberg-Sárközy theorem (Q2256129) (← links)
- Relaxed approximate coloring in exact maximum clique search (Q2257362) (← links)
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem (Q2302299) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- Coloring the edges of a directed graph (Q2353348) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model (Q2672948) (← 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)
- <i>hClique</i>: An exact algorithm for maximum clique problem in uniform hypergraphs (Q4597964) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Deciding the Confusability of Words under Tandem Repeats in Linear Time (Q4972689) (← links)
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection (Q4985798) (← links)
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469) (← links)
- Incremental Upper Bound for the Maximum Clique Problem (Q5131716) (← 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)
