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