MaxCliqueDyn

swMATH8507MaRDI QIDQ20516FDOQ20516

Author name not available (Why is that?)

Described by source

• An improved branch and bound algorithm for the maximum clique problem

Cited In (38)

• 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
• hClique: An exact algorithm for maximum clique problem in uniform hypergraphs
• An exact bit-parallel algorithm for the maximum clique problem
• 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
• Why Is Maximum Clique Often Easy in Practice?
• There is no (75,32,10,16) strongly regular graph
• A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• On comparing algorithms for the maximum clique problem
• Parallel Maximum Clique Algorithms with Applications to Network Analysis
• 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
• 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