scientific article
From MaRDI portal
Publication:2837833
zbMath1274.05452MaRDI QIDQ2837833
Publication date: 5 July 2013
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Large-scale mining co-expressed genes in \textit{Arabidopsis} anther: from pair to group ⋮ Parallel Maximum Clique Algorithms with Applications to Network Analysis ⋮ A review on algorithms for maximum clique problems ⋮ Solving the maximum vertex weight clique problem via binary quadratic programming ⋮ 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 ⋮ Infra-chromatic bound for exact maximum clique search ⋮ A new exact maximum clique algorithm for large and massive sparse graphs ⋮ Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem ⋮ On comparing algorithms for the maximum clique problem ⋮ A maximum clique based approximation algorithm for wireless link scheduling under SINR model ⋮ 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 ⋮ An improved bit parallel exact maximum clique algorithm ⋮ A greedy algorithm to construct covering arrays using a graph representation ⋮ Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications ⋮ Incremental Upper Bound for the Maximum Clique Problem ⋮ A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique ⋮ Why Is Maximum Clique Often Easy in Practice? ⋮ Exact algorithms for maximum clique: a computational study ⋮ Solving the maximum edge biclique packing problem on unbalanced bipartite graphs ⋮ A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs ⋮ Speeding up branch and bound algorithms for solving the maximum clique problem ⋮ A new upper bound for the maximum weight clique problem ⋮ A parallel maximum clique algorithm for large and massive sparse graphs ⋮ An improved lower bound related to the Furstenberg-Sárközy theorem ⋮ Optimizing with minimum satisfiability ⋮ Relaxed approximate coloring in exact maximum clique search ⋮ Mathematical properties and bounds on haplotyping populations by pure parsimony ⋮ An exact bit-parallel algorithm for the maximum clique problem ⋮ There is no (75,32,10,16) strongly regular graph ⋮ SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem ⋮ Deciding the Confusability of Words under Tandem Repeats in Linear Time ⋮ MaxCliqueDyn ⋮ A clique search problem and its application to machine scheduling ⋮ Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection ⋮ A new table of permutation codes ⋮ Estimating clique size by coloring the nodes of auxiliary graphs ⋮ Numerical experiments with LP formulations of the maximum clique problem ⋮ Coloring the edges of a directed graph
