MaxCliqueDyn
From MaRDI portal
Cited in
(54)- Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group
- Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- On comparing algorithms for the maximum clique problem
- QUALEX
- Max-AO
- Cliquer
- Exact algorithms for maximum clique: a computational study
- A new upper bound for the maximum weight clique problem
- Optimizing with minimum satisfiability
- There is no (75,32,10,16) strongly regular graph
- EXTRACOL
- An improved bit parallel exact maximum clique algorithm
- BHOSLIB
- FASoft
- A clique search problem and its application to machine scheduling
- AETG
- A greedy algorithm to construct covering arrays using a graph representation
- Speeding up branch and bound algorithms for solving the maximum clique problem
- An improved lower bound related to the Furstenberg-Sárközy theorem
- Relaxed approximate coloring in exact maximum clique search
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- Estimating clique size by coloring the nodes of auxiliary graphs
- BBMCL
- Coloring the edges of a directed graph
- A review on algorithms for maximum clique problems
- A maximum clique based approximation algorithm for wireless link scheduling under SINR model
- TSpack
- BBMCSP
- biicode
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
- Solving the maximum vertex weight clique problem via binary quadratic programming
- BBMCW
- BITSCAN
- Infra-chromatic bound for exact maximum clique search
- A new exact maximum clique algorithm for large and massive sparse graphs
- Parallel maximum clique algorithms with applications to network analysis
- Algorithm 457
- images
- Coloring the nodes of a directed graph
- On risk-averse maximum weighted subgraph problems
- hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
- A much faster branch-and-bound algorithm for finding a maximum clique
- A local core number based algorithm for the maximum clique problem
- Solving the maximum edge biclique packing problem on unbalanced bipartite graphs
- Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
- Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
- Incremental Upper Bound for the Maximum Clique Problem
- Why is maximum clique often easy in practice?
- A parallel maximum clique algorithm for large and massive sparse graphs
- Mathematical properties and bounds on haplotyping populations by pure parsimony
- gpuls-mwcp
- An exact bit-parallel algorithm for the maximum clique problem
- A new table of permutation codes
This page was built for software: MaxCliqueDyn
