On the public citation graph
A branch and bound algorithm for the maximum clique problem
0 signed · 73 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/net.3230030305openalex-snapshot
Algorithms for a maximum clique and a maximum independent set of a circle graph
inferredcites →https://doi.org/10.1002/net.3230040407openalex-snapshot
Algorithms on circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230110305openalex-snapshot
Finding maximum cliques in circle graphs
inferredcites →https://doi.org/10.1007/bf01580444openalex-snapshot
Vertex packings: Structural properties and algorithms
inferredcites →https://doi.org/10.1007/bf01589347openalex-snapshot
A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles
inferredcites →https://doi.org/10.1007/bf02248731openalex-snapshot
Clique detection for nondirected graphs: Two new algorithms
inferredcites →https://doi.org/10.1016/0095-8956(80)90074-xopenalex-snapshot
On maximal independent sets of vertices in claw-free graphs
inferredcites →https://doi.org/10.1016/0305-0548(90)90048-copenalex-snapshot
Tabaris: An exact algorithm based on tabu search for finding a maximum independent set in a graph
inferredcites →https://doi.org/10.1016/c2013-0-10739-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0167-5060(04)x8001-8openalex-snapshot
Algorithmic Graph Theory and Perfect Graphs
inferredcites →https://doi.org/10.1016/s0304-0208(08)72943-8openalex-snapshot
Polynomial Algorithms for Perfect Graphs
inferredcites →https://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferredcites →https://doi.org/10.1137/0201013openalex-snapshot
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
inferredcites →https://doi.org/10.1137/0214018openalex-snapshot
Maximum Weight Clique Algorithms for Circular-Arc Graphs and Circle Graphs
inferredcites →https://doi.org/10.1137/0215075openalex-snapshot
Finding a Maximum Clique in an Arbitrary Graph
inferredcites →https://doi.org/10.1137/0217003openalex-snapshot
An Optimal Algorithm for Finding a Maximum Independent Set of a Circular-Arc Graph
inferredcites →https://doi.org/10.1145/359094.359101openalex-snapshot
New methods to color the vertices of a graph
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/(sici)1520-684x(199705)28:5<60::aid-scj7>3.0.co;2-mopenalex-snapshot
A simple and efficient branch and bound algorithm for finding a maximum clique with experimental evaluations
inferred← citeshttps://doi.org/10.1007/0-306-48332-7_273openalex-snapshot
Maximum Constraint Satisfaction: Relaxations and Upper Bounds
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_2openalex-snapshot
The One Clause at a Time (OCAT) Approach to Data Mining and Knowledge Discovery
inferred← citeshttps://doi.org/10.1007/3-540-48481-7_37openalex-snapshot
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_357openalex-snapshot
Maximum Constraint Satisfaction: Relaxations and Upper Bounds
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_634openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-1-4757-3279-5_1openalex-snapshot
Approximating Maximum Stable Set and Minimum Graph Coloring Problems with the Positive Semidefinite Relaxation
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_634-1openalex-snapshot
Stable Set Problem: Branch & Cut Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-03536-9_13openalex-snapshot
Fast Algorithms for the Maximum Clique Problem on Massive Sparse Graphs
inferred← citeshttps://doi.org/10.1007/978-3-662-04921-1_6openalex-snapshot
Clique, Independent Set, and Vertex Cover
inferred← citeshttps://doi.org/10.1007/bf01586048openalex-snapshot
Local minima for indefinite quadratic knapsack problems
inferred← citeshttps://doi.org/10.1007/bf01955041openalex-snapshot
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
inferred← citeshttps://doi.org/10.1007/bf02023002openalex-snapshot
Solving the maximum clique problem using a tabu search approach
inferred← citeshttps://doi.org/10.1007/bf02125454openalex-snapshot
Diversification strategies in tabu search algorithms for the maximum clique problem
inferred← citeshttps://doi.org/10.1007/bf02243394openalex-snapshot
A fast algorithm for the maximum weight clique problem
inferred← citeshttps://doi.org/10.1007/bf02257777openalex-snapshot
Finding maximum cliques in arbitrary and in special graphs
inferred← citeshttps://doi.org/10.1007/bfb0020602openalex-snapshot
Structural similarity and adaptation
inferred← citeshttps://doi.org/10.1016/0167-6377(90)90057-copenalex-snapshot
An exact algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.1016/0167-6377(95)00034-hopenalex-snapshot
Solving hard set covering problems
inferred← citeshttps://doi.org/10.1016/0305-0548(95)00075-5openalex-snapshot
On the minimum number of logical clauses inferred from examples
inferred← citeshttps://doi.org/10.1016/j.cor.2017.02.017openalex-snapshot
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
inferred← citeshttps://doi.org/10.1016/j.dam.2003.09.012openalex-snapshot
Variable neighborhood search for the maximum clique
inferred← citeshttps://doi.org/10.1016/j.ejor.2014.09.064openalex-snapshot
A review on algorithms for maximum clique problems
inferred← citeshttps://doi.org/10.1016/j.jfranklin.2022.06.009openalex-snapshot
An approximation lagrangian-based algorithm for the maximum clique problem via deterministic annealing neural network
inferred← citeshttps://doi.org/10.1016/s0167-6377(97)00054-0openalex-snapshot
An algorithm for finding a maximum clique in a graph
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00286-3openalex-snapshot
Enumerating all connected maximal common subgraphs in two graphs
inferred← citeshttps://doi.org/10.1016/s0305-0548(00)00053-8openalex-snapshot
Finding all k-cliques in k-partite graphs, an application in textile engineering
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00853-6openalex-snapshot
The composition of semi-finished inventories at a solid board plant
inferred← citeshttps://doi.org/10.1016/s0377-2217(99)00235-0openalex-snapshot
A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
inferred← citeshttps://doi.org/10.1023/a:1026456624746openalex-snapshot
An Augmentation Algorithm for the Maximum Weighted Stable Set Problem
inferred← citeshttps://doi.org/10.1080/15427951.2014.986778openalex-snapshot
Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection
inferred← citeshttps://doi.org/10.1093/bioinformatics/btq506openalex-snapshot
R3D Align: global pairwise alignment of RNA 3D structures using local superpositions
inferred← citeshttps://doi.org/10.1093/jcde/qwac010openalex-snapshot
Cellular goore game with application to finding maximum clique in social networks
inferred← citeshttps://doi.org/10.1109/access.2020.3028112openalex-snapshot
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.1109/ipdps64566.2025.00025openalex-snapshot
Less is More: Faster Maximum Clique Search by Work-Avoidance
inferred← citeshttps://doi.org/10.1109/jproc.2020.2977595openalex-snapshot
A Tutorial on Clique Problems in Communications and Signal Processing
inferred← citeshttps://doi.org/10.1109/tcad.2004.828136openalex-snapshot
Probabilistic Constructive Optimization Techniques
inferred← citeshttps://doi.org/10.1109/tse.2007.1017openalex-snapshot
Semantics-Preserving Design of Embedded Control Software from Synchronous Models
inferred← citeshttps://doi.org/10.1109/tse.2007.70718openalex-snapshot
Semantics-Preserving Design of Embedded Control Software from Synchronous Models
inferred← citeshttps://doi.org/10.1287/ijoc.10.4.438openalex-snapshot
A Branch and Bound Algorithm for the Stability Number of a Sparse Graph
inferred← citeshttps://doi.org/10.1287/mnsc.1040.0336openalex-snapshot
CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions
inferred← citeshttps://doi.org/10.14257/ijca.2018.11.3.04openalex-snapshot
Approximate Maximum Clique Algorithm (AMCA): A Clever Technique for Solving the Maximum Clique Problem through Near Optimal Algorithm for Minimum Vertex Cover Problem
inferred← citeshttps://doi.org/10.18130/v37t14openalex-snapshot
A Spectrum Allocation and Auction Mechanism With The Maximum Weighed Independent Set
inferred← citeshttps://doi.org/10.21203/rs.3.rs-3111268/v1openalex-snapshot
NK-PMC: A new exact branch and bound parallel algorithm for the maximum clique problem
inferred← citeshttps://doi.org/10.21236/ada275328openalex-snapshot
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring
inferred← citeshttps://doi.org/10.3233/978-1-61499-672-9-939openalex-snapshot
Combining Efficient Preprocessing and Incremental MaxSAT Reasoning for MaxClique in Large Graphs
inferred← citeshttps://doi.org/10.3390/math12182850openalex-snapshot
Probabilistic Cellular Automata Monte Carlo for the Maximum Clique Problem
inferred← citeshttps://doi.org/10.4018/ijoris.2018100102openalex-snapshot
Solving the Maximum Clique Problem using a Hybrid Particle Swarm Optimization Algorithm
inferred← citeshttps://doi.org/10.46336/ijqrm.v1i4.82openalex-snapshot
Alternative Branching Strategies in the Branch and Bound Algorithm by Using a K-Clique Covering Vertex Set for Maximum Clique Problems
inferred← citeshttps://doi.org/10.48550/arxiv.1303.2546openalex-snapshot
On the Complexity of Maximum Clique Algorithms: usage of coloring heuristics leads to the 2^(n\5) algorithm running time lower bound
inferred← citeshttps://doi.org/10.5120/11897-7956openalex-snapshot
A Binary Harmony Search Algorithm for Solving the Maximum Clique Problem
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.