On the public citation graph
Finding maximum cliques in arbitrary and in special graphs
0 signed · 87 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.1975.5.3.299openalex-snapshot
GRAPH THEORY WITH APPLICATIONS TO ENGINEERING AND COMPUTER SCIENCE
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.1002/net.3230120410openalex-snapshot
Efficient algorithms for interval graphs and circular‐arc graphs
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1002/net.3230200203openalex-snapshot
Efficient algorithms for finding maximum cliques of an overlap graph
inferredcites →https://doi.org/10.1007/978-3-7091-9076-0_10openalex-snapshot
Heuristics for Graph Coloring
inferredcites →https://doi.org/10.1007/bf01415983openalex-snapshot
A branch and bound algorithm for the maximum clique problem
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/0020-0190(81)90041-7openalex-snapshot
The clique problem for planar graphs
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/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(87)90021-6openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(88)90023-5openalex-snapshot
Stability in circular arc 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/0898-1221(83)90115-3openalex-snapshot
A new backtracking algorithm for generating the family of maximal independent sets of 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)72944-xopenalex-snapshot
Algorithms for Maximum Weight Cliques, Minimum Weighted Clique Covers and Minimum Colorings of Claw-Free Perfect Graphs
inferredcites →https://doi.org/10.1080/00207168208803311openalex-snapshot
Determining the number of internal stability of a graph
inferredcites →https://doi.org/10.1109/proc.1975.9996openalex-snapshot
Graph theory with applications to engineering and computer science
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/0205021openalex-snapshot
Algorithmic Aspects of Vertex Elimination on Graphs
inferredcites →https://doi.org/10.1137/0214065openalex-snapshot
A Linear Recognition Algorithm for Cographs
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/321607.321608openalex-snapshot
An Analysis of Some Graph Theoretical Cluster Techniques
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
inferredcites →https://doi.org/10.2140/pjm.1965.15.835openalex-snapshot
Incidence matrices and interval graphs
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-6750(199912)46:8<893::aid-nav2>3.0.co;2-7openalex-snapshot
Minimizing makespan in a multimode multiprocessor shop scheduling problem
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.1002/nav.1033openalex-snapshot
Iterative coloring extension of a maximum clique
inferred← citeshttps://doi.org/10.1002/net.1028openalex-snapshot
Solving the minimum‐weighted coloring problem
inferred← citeshttps://doi.org/10.1002/net.21906openalex-snapshot
An extended formulation for the 1‐wheel inequalities of the stable set polytope
inferred← citeshttps://doi.org/10.1002/wcms.5openalex-snapshot
Maximum common subgraph isomorphism algorithms and their applications in molecular science: a review
inferred← citeshttps://doi.org/10.1007/0-306-46873-5_6openalex-snapshot
Subset-Selection Methods For Chemical Databases
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-1-4419-7997-1_9openalex-snapshot
Graph Theoretic Clique Relaxations and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4612-1480-9_3openalex-snapshot
Matching of Chemical and Biological Structures Using Subgraph and Maximal Common Subgraph Isomorphism Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4614-0857-4_5openalex-snapshot
Clique Relaxation Models in Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4614-6624-6_9-1openalex-snapshot
Degree and Distance-Based Clique Relaxations
inferred← citeshttps://doi.org/10.1007/978-1-4615-5533-9_6openalex-snapshot
Solving a Preemptive Project Scheduling Problem with Coloring Techniques
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-642-20862-1_14openalex-snapshot
Following the Conversation: A More Meaningful Expression of Engagement
inferred← citeshttps://doi.org/10.1007/bf01299447openalex-snapshot
An exact algorithm for the maximum stable set problem
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/bf02243394openalex-snapshot
A fast algorithm for the maximum weight clique problem
inferred← citeshttps://doi.org/10.1007/s10479-006-0085-9openalex-snapshot
Novel evolutionary models and applications to sequence alignment problems
inferred← citeshttps://doi.org/10.1007/s10589-013-9548-5openalex-snapshot
Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations
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/0377-2217(94)90252-6openalex-snapshot
A multi-KP modeling for the maximum-clique problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.05.026openalex-snapshot
Clique-detection models in computational biochemistry and genomics
inferred← citeshttps://doi.org/10.1016/j.jplph.2010.09.010openalex-snapshot
Large cliques in Arabidopsis gene coexpression network and motif discovery
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00290-6openalex-snapshot
A fast algorithm for the maximum clique problem
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/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(99)00235-0openalex-snapshot
A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
inferred← citeshttps://doi.org/10.1016/s1093-3263(97)00089-2openalex-snapshot
Clique-Detection Algorithms for Matching Three-Dimensional Molecular Structures
inferred← citeshttps://doi.org/10.1023/a:1013665718444openalex-snapshot
Constraint Propagation in Graph Coloring
inferred← citeshttps://doi.org/10.1023/a:1026456624746openalex-snapshot
An Augmentation Algorithm for the Maximum Weighted Stable Set Problem
inferred← citeshttps://doi.org/10.1086/426155openalex-snapshot
A Genomewide Search Using an Original Pairwise Sampling Approach for Large Genealogies Identifies a New Locus for Total and Low-Density Lipoprotein Cholesterol in Two Genetically Differentiated Isolates of Sardinia
inferred← citeshttps://doi.org/10.1088/1742-6596/268/1/012030openalex-snapshot
Parallel algorithms for finding cliques in a graph
inferred← citeshttps://doi.org/10.1089/106652799318382openalex-snapshot
Dissimilarity-Based Algorithms for Selecting Structurally Diverse Sets of Compounds
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.12.1198openalex-snapshot
Visualizing plant metabolomic correlation networks using clique–metabolite matrices
inferred← citeshttps://doi.org/10.1093/bioinformatics/btm617openalex-snapshot
Jenti: an efficient tool for mining complex inbred genealogies
inferred← citeshttps://doi.org/10.1107/s0907444902005450openalex-snapshot
High-resolution crystallographic map interpretation
inferred← citeshttps://doi.org/10.1109/csd.1998.657547openalex-snapshot
Calculating place capacity for Petri nets using unfoldings
inferred← citeshttps://doi.org/10.1109/dac.1999.781316openalex-snapshot
Graph coloring algorithms for fast evaluation of Curtis decompositions
inferred← citeshttps://doi.org/10.1145/309847.309918openalex-snapshot
Graph coloring algorithms for fast evaluation of Curtis decompositions
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.21236/ada275328openalex-snapshot
Weighted and Unweighted Maximum Clique Algorithms with Upper Bounds from Fractional Coloring
inferred← citeshttps://doi.org/10.48550/arxiv.0710.0748openalex-snapshot
A Fast Heuristic Algorithm Based on Verification and Elimination Methods for Maximum Clique Problem
inferred← citeshttps://doi.org/10.48550/arxiv.1807.08350openalex-snapshot
Tracking Mobile Intruders in an Art Gallery: Guard Deployment Strategies, Fundamental Limitations, and Performance Guarantees
inferred← citeshttps://doi.org/10.5281/zenodo.190898openalex-snapshot
FIGURE 6 in Description and comparison of morphological structures of the eggs of Anopheles hyrcanus group and related species (Diptera: Culicidae) from the Republic of Korea
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.