scientific article; zbMATH DE number 2040957
From MaRDI portal
Publication:4452109
zbMath1038.68565MaRDI QIDQ4452109
Publication date: 11 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2731/27310278.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
A review on algorithms for maximum clique problems, Detecting robust cliques in graphs subject to uncertain edge failures, Reducing graph coloring to clique search, Efficiently enumerating all maximal cliques with bit-parallelism, On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem, A new exact maximum clique algorithm for large and massive sparse graphs, The worst-case time complexity for generating all maximal cliques and computational experiments, An approximation Lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network, An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments, An adaptive multistart tabu search approach to solve the maximum clique problem, On comparing algorithms for the maximum clique problem, An efficient local search algorithm for solving maximum edge weight clique problem in large graphs, Coloring the nodes of a directed graph, A Max-SAT Inference-Based Pre-processing for Max-Clique, 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, Combinatorial algorithms for the maximum \(k\)-plex problem, Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications, Improvements to MCS algorithm for the maximum clique problem, Incremental Upper Bound for the Maximum Clique Problem, A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique, Multi-threading a state-of-the-art maximum clique algorithm, Solving the maximum edge biclique packing problem on unbalanced bipartite graphs, Co-2-plex vertex partitions, 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 parallel maximum clique algorithm for large and massive sparse graphs, Optimizing with minimum satisfiability, Relaxed approximate coloring in exact maximum clique search, An exact bit-parallel algorithm for the maximum clique problem, Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound, An Extended Comparison of the Best Known Algorithms for Finding the Unweighted Maximum Clique, SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem, A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem, 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, An effective local search for the maximum clique problem, 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, A parallel branch and bound algorithm for the maximum labelled clique problem
