A branch and bound algorithm for the maximum clique problem

No abstract is available for this paper.

• Publication year

  1990

• Venue

  ZOR Methods Model. Oper. Res.

• Publication date

  1990-05-01

• Fields of study

  Not labeled

• Identifiers
  DOI 10.1007/BF01415983
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph

  1990cited by this paper
• An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph

  1988cited by this paper
• Finding a Maximum Clique in an Arbitrary Graph

  1986cited by this paper
• Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs

  1985cited by this paper
• Polynomial Algorithms for Perfect Graphs

  1984cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• Determining the number of internal stability of a graph

  1982cited by this paper
• A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles

  1981cited by this paper
• Finding maximum cliques in circle graphs

  1981cited by this paper
• On maximal independent sets of vertices in claw-free graphs

  1980cited by this paper
• Algorithmic graph theory and perfect graphs

  1980cited by this paper
• New methods to color the vertices of a graph

  1979cited by this paper
• A node covering algorithm

  1977cited by this paper
• Finding a Maximum Independent Set

  1976cited by this paper
• Vertex packings: Structural properties and algorithms

  1975cited by this paper
• Algorithms on circular-arc graphs

  1974cited by this paper
• Algorithms for a maximum clique and a maximum independent set of a circle graph

  1973cited by this paper
• Algorithm 457: finding all cliques of an undirected graph

  1973cited by this paper
• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

  1972cited by this paper

• Adaptive Landscapes of Plasmodium Falciparum Dihydrofolate Reductase Reveal Pathways to Antifolate Resistance

  2026cites this paper
• Rounding the Lov\'asz Theta Function with a Value Function Approximation

  2025cites this paper
• An Efficient Seed-Initialized Algorithm for Maximal Clique Enumeration and Its Applications

  2025cites this paper
• A bisection method for solving distance-based clustering problems globally

  2024cites this paper
• Dataless Quadratic Neural Networks for the Maximum Independent Set Problem

  2024cites this paper
• Navigating the Fitness Landscapes of Plasmodium falciparum Dihydrofolate Reductase: Evolutionary Insights into Antifolate Resistance

  2024influential citation
• Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem

  2024cites this paper
• A unified pre-training and adaptation framework for combinatorial optimization on graphs

  2023cites this paper
• Harnessing the mathematics of matrix decomposition to solve planted and maximum clique problem

  2023cites this paper
• What's Wrong with Deep Learning in Tree Search for Combinatorial Optimization

  2022cites this paper
• Combinatorial Optimization Problems

  2022cites this paper
• A matrix nonconvex relaxation approach to unconstrained binary polynomial programs

  2022cites this paper
• SMC-BRB: an algorithm for the maximum clique problem over large and sparse graphs with the upper bound via $$s^+$$ s + -index

  2022cites this paper
• An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network

  2022cites this paper
• Cellular goore game with application to finding maximum clique in social networks

  2022cites this paper
• Exact approaches for the Connected Vertex Cover problem

  2022cites this paper
• Solving binary semidefinite programming problems and binary linear programming problems via multi-objective programming

  2022cites this paper
• Convex Formulation for Planted Quasi-Clique Recovery

  2021cites this paper
• A local core number based algorithm for the maximum clique problem

  2021cites this paper
• A RELAXATION APPROACH TO UBPP BASED ON EQUIVALENT DC PENALIZED FACTORIZED MATRIX PROGRAMS∗

  2021cites this paper
• NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem

  2020cites this paper
• Finding a maximum clique in social networks using a modified differential evolution algorithm

  2020cites this paper
• Alternative Branching Strategies in the Branch and Bound Algorithm by Using a K-Clique Covering Vertex Set for Maximum Clique Problems

  2020cites this paper
• Relaxation approaches to a class of UBPPs based on equivalent DC penalized matrix programs

  2020cites this paper
• Kobe University Repository : Kernel タイトル Tit le Fast maximum weight clique extract ion algorithm : Opt imal tables for branch-and-bound 著者

  2019cites this paper
• Generalized Fault-Tolerance Topology Generation for Application-Specific Network-on-Chips

  2019cites this paper
• Size Watermelon Apple Grape Color Shape Size Size Banana GrapeFruit Lemon Apple Taste

  2019cites this paper
• Solving the Maximum Clique Problem using a Hybrid Particle Swarm Optimization Algorithm

  2018cites this paper
• Branch and Bound Algorithm for Finding the Maximum Clique Problem

  2018cites this paper
• Aspects of stability for multicriteria quadratic problems of Boolean programming

  2018cites this paper
• A Tutorial on Clique Problems in Communications and Signal Processing

  2018cites this paper
• Fast maximum weight clique extraction algorithm: Optimal tables for branch-and-bound

  2017cites this paper
• On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem

  2017cites this paper
• ENUMERATING K-CLIQUES IN A LARGE NETWORK USING APACHE SPARK

  2017cites this paper
• Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs

  2016cites this paper
• Approche multicritère pour la recherche de site et l'optimisation de technologies d'énergies marines renouvelables

  2015cites this paper
• Solving constrained quadratic binary problems via quantum adiabatic evolution

  2015cites this paper
• Building an iterative heuristic solver for a quantum annealer

  2015cites this paper
• A review on algorithms for maximum clique problems

  2015cites this paper
• Finding Maximum Clique in Stochastic Graphs Using Distributed Learning Automata

  2015cites this paper
• An Integrated Approach to Studying Multiplexity in Entrepreneurial Networks

  2014cites this paper
• The unconstrained binary quadratic programming problem: a survey

  2014cites this paper
• The optimal target assignment in the cooperative surveillance task of satellite formation flying

  2014cites this paper
• Empirical Algorithmics: draw your own conclusions

  2014cites this paper
• A Polynomial Time Solution to the Clique Problem

  2014cites this paper
• MAXIMUM CLIQUE PROBLEM SOLVING USING IMPERIALIST COMPETITIVE ALGORITHM AND A GREEDY METHOD FOR GENERATING INITIAL POPULATION

  2014cites this paper
• Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection

  2014cites this paper
• An Algorithm for Generating All Connected Subgraphs with k Vertices of a Graph

  2013cites this paper
• A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem

  2013cites this paper
• On the Complexity of Maximum Clique Algorithms: usage of coloring heuristics leads to the 2^(n\5) algorithm running time lower bound

  2013cites this paper
• On the Independent Set and Common Subgraph Problems in Random Graphs

  2013cites this paper
• The CP-Matrix Completion Problem

  2013cites this paper
• Problèmes NP-difficiles : approximation modérément exponentielle et complexité paramétrique. (NP-Hard problems : moderately exponential approximation and parameterized complexity)

  2013cites this paper
• New results on some quadratic programming problems

  2013cites this paper
• Linear and Integer Programming with Sensitivity Analysis Approach

  2013cites this paper
• A tutorial on branch and cut algorithms for the maximum stable set problem

  2012cites this paper
• Quantitative Application Data Flow Characterization for Heterogeneous Multicore Architectures

  2012cites this paper
• RESEARCH ARTICLE Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

  2012cites this paper
• Distributing an Exact Algorithm for Maximum Clique: maximising the costup

  2012cites this paper
• A continuation approach for solving binary quadratic program based on a class of NCP-functions

  2012cites this paper
• Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs

  2012cites this paper
• An Improved Algorithm for Protein Structural Comparison Based on Graph Theoretical Approach +

  2011cites this paper
• Reductions for the Stable Set Problem

  2011cites this paper
• Depth-first simplicial partition for copositivity detection, with an application to MaxClique

  2011cites this paper
• Several versions of the devour digest tidy-up heuristic for unconstrained binary quadratic problems

  2011cites this paper
• Fast exact feature based data correspondence search with an efficient bit-parallel MCP solver

  2010cites this paper
• R3D Align: global pairwise alignment of RNA 3D structures using local superpositions

  2010influential citation
• Global Optimal Conditions for Quadratic Integer Problem with Box Constraints

  2010cites this paper
• Several versions of Devour Digest Tidy-up Heuristic for Large-Scale Unconstrained Binary Quadratic Problem

  2010cites this paper
• Measuring Protein Structural Similarity by Maximum Common Edge Subgraphs

  2010cites this paper
• Optimization Methods in Logic

  2010cites this paper
• Protein Structure Comparison: From Contact Map Overlap Maximisation to Distance-based Alignment Search Tool. (La comparaison structurale des protéines : de la maximisation du recouvrement de cartes de contacts à l'alignement basé sur les distances)

  2010cites this paper
• Solving Maximum Clique Problem for Protein Structure Similarity

  2009cites this paper
• Stable Set Problem: Branch & Cut Algorithms

  2009cites this paper
• Decomposições Lagrangeanas para o problema de programação quadrática binária irrestrita

  2009cites this paper
• Graph theoretic generalizations of clique: optimization and extensions

  2009cites this paper
• Independence Systems and Stable Set Relaxations

  2008cites this paper
• A global continuation algorithm for solving binary quadratic programming problems

  2008cites this paper
• Global equilibrium search applied to the unconstrained binary quadratic optimization problem

  2008cites this paper
• Perturbation Based Search Method for Solving Unconstrained Binary Quadratic Programming Problem

  2008influential citation
• New algorithms for quadratic unconstrained binary optimization (qubo) with applications in engineering and social sciences

  2008influential citation
• Automatic Indexing, Retrieval and Reuse of Topologies in Architectual Layouts

  2007cites this paper
• Fixed interval scheduling: Models, applications, computational complexity and algorithms

  2007cites this paper
• A simple simulated annealing algorithm for the maximum clique problem

  2007cites this paper
• Semantics-Preserving Design of Embedded Control Software from Synchronous Models

  2007cites this paper
• Exploiting CPU Bit Parallel Operations to Improve Efficiency in Search

  2007cites this paper
• Combinatorial design of a minimum cost transfer line with parallel operations at workstations

  2007cites this paper
• Comparing the best maximum clique finding algorithms, which are using heuristic vertex colouring

  2006influential citation
• A Tight Lower Bound for a Special Case of Quadratic 0–1 Programming

  2006cites this paper
• THE ONE CLAUSE AT A TIME (OCAT) APPROACH TO DATA MINING AND KNOWLEDGE DISCOVERY

  2006cites this paper
• Efficient Search Using Bitboard Models

  2006cites this paper
• RRR 10 – 2006 , April , 2006 Preprocessing of Unconstrained Quadratic Binary Optimization

  2006cites this paper
• Memetic algorithms for combinatorial optimization problems : fitness landscapes and effective search strategies

  2006cites this paper
• A Unified Framework for Modeling and Solving Combinatorial Optimization Problems: A Tutorial

  2006cites this paper
• SYSTEMS ANALYSIS PROBLEMS OF DISCRETE OPTIMIZATION : CHALLENGES AND MAIN APPROACHES TO SOLVE

  2006cites this paper
• A polyhedral study of the generalized vertex packing problem

  2006cites this paper
• A note on finding a maximum clique in a graph using BDDs.

  2005cites this paper
• An Unconstrained Quadratic Binary Programming Approach to the Vertex Coloring Problem

  2005cites this paper
• Probabilistic constructive optimization techniques

  2004cites this paper
• DEVELOPMENT OF A BRANCH AND PRICE APPROACH INVOLVING VERTEX CLONING TO SOLVE THE MAXIMUM WEIGHTED INDEPENDENT SET PROBLEM

  2004influential citation