A simple and faster branch-and-bound algorithm for finding a maximum clique

DOI10.1007/978-3-642-11440-3_18zbMATH Open1274.05455OpenAlexW1594785451MaRDI QIDQ3404446FDOQ3404446

Authors: Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, Mitsuo Wakatsuki

Publication date: 9 February 2010

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-11440-3_18

Recommendations

A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
A fast algorithm for the maximum clique problem
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
scientific article; zbMATH DE number 2040957
An improved branch and bound algorithm for the maximum clique problem

Random graphs (graph-theoretic aspects) (05C80) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cited In (48)

Fast maximum weight clique extraction algorithm: optimal tables for branch-and-bound
Relaxed approximate coloring in exact maximum clique search
An exact algorithm for the maximum probabilistic clique problem
On risk-averse maximum weighted subgraph problems
An improved branch and bound algorithm for the maximum clique problem
A new branch-and-bound algorithm for the maximum weighted clique 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
Finding clique clusters with the highest betweenness centrality
An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs
Scale reduction techniques for computing maximum induced bicliques
Identifying risk-averse low-diameter clusters in graphs with stochastic vertex weights
A parallel branch and bound algorithm for the maximum labelled clique problem
A fast algorithm for the maximum clique problem
Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications
Title not available (Why is that?)
Title not available (Why is that?)
An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
On comparing algorithms for the maximum clique problem
Title not available (Why is that?)
An enhanced bitstring encoding for exact maximum clique search in sparse graphs
On the power of simple reductions for the maximum independent set problem
Speeding up MCS algorithm for the maximum clique problem with ILS heuristic and other enhancements
SQBC: an efficient subgraph matching method over large and dense graphs
A new exact maximum clique algorithm for large and massive sparse graphs
Infra-chromatic bound for exact maximum clique search
CliSAT: a new exact algorithm for hard maximum clique problems
Multi-threading a state-of-the-art maximum clique algorithm
Speeding up branch and bound algorithms for solving the maximum clique problem
Improvements to MCS algorithm for the maximum clique problem
A maximum edge-weight clique extraction algorithm based on branch-and-bound
Incremental Upper Bound for the Maximum Clique Problem
A new upper bound for the maximum weight clique problem
Why is maximum clique often easy in practice?
Efficiently enumerating all maximal cliques with bit-parallelism
A review on algorithms for maximum clique problems
A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem
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
A nonconvex quadratic optimization approach to the maximum edge weight clique problem
Finding near-optimal independent sets at scale
Improved infra-chromatic bound for exact maximum clique search
Large-scale frequent stem pattern mining in RNA families
An improved bit parallel exact maximum clique algorithm
A parallel maximum clique algorithm for large and massive sparse graphs

Uses Software

DIMACS

This page was built for publication: A simple and faster branch-and-bound algorithm for finding a maximum clique

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3404446)