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