On the public citation graph
Cliques of a graph-variations on the Bron-Kerbosch algorithm
0 signed · 104 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.1007/bf00985661openalex-snapshot
A clique-detection algorithm based on neighborhoods in graphs
inferredcites →https://doi.org/10.1109/t-c.1973.223683openalex-snapshot
On a New Approach for Finding All the Modified Cut-Sets in an Incompatibility Graph
inferredcites →https://doi.org/10.1137/0202001openalex-snapshot
The Enumeration of Maximal Cliques of Large Graphs
inferredcites →https://doi.org/10.1145/321607.321608openalex-snapshot
An Analysis of Some Graph Theoretical Cluster Techniques
inferredcites →https://doi.org/10.1145/321694.321698openalex-snapshot
Corrections to Bierstone's Algorithm for Generating Cliques
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.1007/978-1-4614-0857-4_5openalex-snapshot
Clique Relaxation Models in Social Network Analysis
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-02964-7_4openalex-snapshot
Fault Modeling, Structural Testing, and Functional Testing
inferred← citeshttps://doi.org/10.1007/978-3-030-81885-2_6openalex-snapshot
Clique, Independent Set, and Vertex Cover
inferred← citeshttps://doi.org/10.1007/978-3-031-04812-8_23openalex-snapshot
The Problems and Advantages of Using Non-separable Block Codes
inferred← citeshttps://doi.org/10.1007/978-3-031-21127-0_34openalex-snapshot
Geometric Deep Learning Graph Pruning to Speed-Up the Run-Time of Maximum Clique Enumerarion Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-031-64608-9_7openalex-snapshot
MPCD: An Algorithm for Discovering Multilevel Prevalent Co-location Patterns from Heterogeneous Distribution of Spatial Datasets
inferred← citeshttps://doi.org/10.1007/978-3-032-36871-3_3openalex-snapshot
Detecting Citation Cartels: A Preliminary Review
inferred← citeshttps://doi.org/10.1007/978-3-319-50751-4_18openalex-snapshot
Data-Driven Evolutionary-Game-Based Control for Drinking-Water Networks
inferred← citeshttps://doi.org/10.1007/978-3-319-78658-2_10openalex-snapshot
A Relevance Index Method to Infer Global Properties of Biological Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-87477-5_39openalex-snapshot
Finding Maximum Common Connected Subgraphs Using Clique Detection or Constraint Satisfaction Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-642-17517-6_36openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-Optimal Time
inferred← citeshttps://doi.org/10.1007/978-3-642-68826-3_3openalex-snapshot
Symbolic Description and Matching of Image Sequences
inferred← citeshttps://doi.org/10.1007/978-3-662-02390-7_40openalex-snapshot
Symbolische Symmetrieanalyse
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/bf03040859openalex-snapshot
A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
inferred← citeshttps://doi.org/10.1007/s00778-006-0019-9openalex-snapshot
Efficient algorithms for mining maximal valid groups
inferred← citeshttps://doi.org/10.1007/s10822-016-9930-3openalex-snapshot
Docking pose selection by interaction pattern graph similarity: application to the D3R grand challenge 2015
inferred← citeshttps://doi.org/10.1007/s11750-024-00684-wopenalex-snapshot
A bisection method for solving distance-based clustering problems globally
inferred← citeshttps://doi.org/10.1016/0020-7101(90)90017-oopenalex-snapshot
An algorithm for approximating conditional probabilities
inferred← citeshttps://doi.org/10.1016/0031-3203(84)90043-8openalex-snapshot
Image sequence analysis using relational structures
inferred← citeshttps://doi.org/10.1016/0098-3004(84)90007-4openalex-snapshot
Unitary associations method: use of graph theory and computer algorithm
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90032-5openalex-snapshot
Algorithms for maximum independent sets
inferred← citeshttps://doi.org/10.1016/0306-4573(79)90059-1openalex-snapshot
Graph models of complex information sources
inferred← citeshttps://doi.org/10.1016/j.automatica.2016.02.004openalex-snapshot
Constrained distributed optimization: A population dynamics approach
inferred← citeshttps://doi.org/10.1016/j.comnet.2019.01.043openalex-snapshot
An effective channel allocation algorithm to maximize system utility in heterogeneous DCB WLANs
inferred← citeshttps://doi.org/10.1016/j.cor.2017.12.006openalex-snapshot
Efficiently enumerating all maximal cliques with bit-parallelism
inferred← citeshttps://doi.org/10.1016/j.datak.2006.01.005openalex-snapshot
Clicks: An effective algorithm for mining subspace clusters in categorical datasets
inferred← citeshttps://doi.org/10.1016/j.epsr.2019.106169openalex-snapshot
A sparse convex AC OPF solver and convex iteration implementation based on 3-node cycles
inferred← citeshttps://doi.org/10.1016/j.eswa.2016.07.007openalex-snapshot
A fast space-saving algorithm for maximal co-location pattern mining
inferred← citeshttps://doi.org/10.1016/j.eswa.2025.128283openalex-snapshot
Candidate range limitation for efficient rainbow clique detection
inferred← citeshttps://doi.org/10.1016/j.ifacol.2017.08.1988openalex-snapshot
On the Communication Discussion of Two Distributed Population-game Approaches for Optimization Purposes
inferred← citeshttps://doi.org/10.1016/j.jpdc.2009.01.003openalex-snapshot
A scalable, parallel algorithm for maximal clique enumeration
inferred← citeshttps://doi.org/10.1016/j.robot.2026.105427openalex-snapshot
Real-time cooperative scheduling for CAVs at signal-free intersections via dynamic graph analysis and tree search
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.06.015openalex-snapshot
The worst-case time complexity for generating all maximal cliques and computational experiments
inferred← citeshttps://doi.org/10.1016/j.tcs.2010.03.011openalex-snapshot
Theoretical underpinnings for maximal clique enumeration on perturbed graphs
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.1021/ci300566nopenalex-snapshot
Encoding Protein–Ligand Interaction Patterns in Fingerprints and Graphs
inferred← citeshttps://doi.org/10.1037//0033-295x.86.2.87openalex-snapshot
Additive clustering: Representation of similarities as combinations of discrete overlapping properties.
inferred← citeshttps://doi.org/10.1080/0022250x.1978.9989883openalex-snapshot
A graph‐theoretic generalization of the clique concept
inferred← citeshttps://doi.org/10.1080/10618600.2019.1677474openalex-snapshot
Testing One Hypothesis Multiple Times: The Multidimensional Case
inferred← citeshttps://doi.org/10.1088/1757-899x/790/1/012076openalex-snapshot
List all Maximal Cliques of an Undirected Graph: A Parallable Algorithm
inferred← citeshttps://doi.org/10.1089/cmb.1996.3.289openalex-snapshot
An Algorithm for Finding Maximal Common Subtopologies in a Set of Protein Structures
inferred← citeshttps://doi.org/10.1093/bioinformatics/17.6.487openalex-snapshot
Uniform integration of genome mapping data using intersection graphs
inferred← citeshttps://doi.org/10.1093/comjnl/23.3.242openalex-snapshot
Automatic Speech and Speaker Recognition
inferred← citeshttps://doi.org/10.1109/access.2020.3020805openalex-snapshot
Modeling and Scheduling Methods for Batch Production Systems Based on Petri Nets and Heuristic Search
inferred← citeshttps://doi.org/10.1109/access.2023.3339793openalex-snapshot
Task-Aware Dynamic Model Optimization for Multi-Task Learning
inferred← citeshttps://doi.org/10.1109/ccaa.2017.8229886openalex-snapshot
Key community analysis in scientific collaboration network
inferred← citeshttps://doi.org/10.1109/compcomm.2017.8322922openalex-snapshot
A new algorithm for enumerating all maximal cliques
inferred← citeshttps://doi.org/10.1109/comst.2021.3118271openalex-snapshot
Online Advertising Security: Issues, Taxonomy, and Future Directions
inferred← citeshttps://doi.org/10.1109/icdm.2011.82openalex-snapshot
Interesting Multi-relational Patterns
inferred← citeshttps://doi.org/10.1109/icdmw.2018.00048openalex-snapshot
Finding Tenuous Groups in Social Networks
inferred← citeshttps://doi.org/10.1109/icsmc.2008.4811845openalex-snapshot
An anytime-anywhere approach for maximal clique enumeration in social network analysis
inferred← citeshttps://doi.org/10.1109/iscit.2019.8905244openalex-snapshot
Community-based Random Access Scheme for M2M Communications in LTE Networks
inferred← citeshttps://doi.org/10.1109/ispa-bdcloud-socialcom-sustaincom52081.2021.00219openalex-snapshot
Centralized Graph based TSCH Scheduling for IoT Network Applications
inferred← citeshttps://doi.org/10.1109/iwcmc.2015.7289213openalex-snapshot
An NC-DTN framework for many-to-many bulk data dissemination in OLSR MANET
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/ldav.2017.8231847openalex-snapshot
Maximal clique enumeration with data-parallel primitives
inferred← citeshttps://doi.org/10.1109/monetec49726.2020.9258345openalex-snapshot
Application of Recommender Systems Approaches to the MPI Program Execution Time Prediction
inferred← citeshttps://doi.org/10.1109/padsw.2014.7097844openalex-snapshot
pbitMCE: A bit-based approach for maximal clique enumeration on multicore processors
inferred← citeshttps://doi.org/10.1109/taes.2025.3570276openalex-snapshot
A Hybrid Reactive Routing Protocol for Decentralized UAV Networks
inferred← citeshttps://doi.org/10.1109/tc.1986.1676847openalex-snapshot
An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
inferred← citeshttps://doi.org/10.1109/tcad.2017.2740299openalex-snapshot
Structural and Functional Test Methods for Micro-Electrode-Dot-Array Digital Microfluidic Biochips
inferred← citeshttps://doi.org/10.1109/tpds.2021.3067053openalex-snapshot
Accelerating the Bron-Kerbosch Algorithm for Maximal Clique Enumeration Using GPUs
inferred← citeshttps://doi.org/10.1109/tvt.2017.2778345openalex-snapshot
Learning-Aided Network Association for Hybrid Indoor LiFi-WiFi Systems
inferred← citeshttps://doi.org/10.1137/0208032openalex-snapshot
The Complexity of Enumeration and Reliability Problems
inferred← citeshttps://doi.org/10.1145/2543629openalex-snapshot
Listing All Maximal Cliques in Large Sparse Real-World Graphs
inferred← citeshttps://doi.org/10.1145/2557977.2558045openalex-snapshot
A tweet summarization method based on a keyword graph
inferred← citeshttps://doi.org/10.1145/2567634.2567640openalex-snapshot
Maximal clique enumeration for large graphs on hadoop framework
inferred← citeshttps://doi.org/10.1145/3820441.3820451openalex-snapshot
SCOPE: Spatio-Temporal Collaborative Caching and Proactive Transfer in LEO Satellite Networks
inferred← citeshttps://doi.org/10.11606/d.55.2016.tde-29032016-092853openalex-snapshot
Análise dos caminhos de execução de programas para a paralelização automática de códigos binários para a plataforma Intel x86
inferred← citeshttps://doi.org/10.1371/journal.pone.0296185openalex-snapshot
Geometric Deep Learning sub-network extraction for Maximum Clique Enumeration
inferred← citeshttps://doi.org/10.17586/2226-1494-2026-26-1-42-50openalex-snapshot
Minimization of passive motion time in laser microvia drilling of ABF dielectrics
inferred← citeshttps://doi.org/10.18653/v1/2020.acl-main.318openalex-snapshot
A Graph-based Coarse-to-fine Method for Unsupervised Bilingual Lexicon Induction
inferred← citeshttps://doi.org/10.2307/2348080openalex-snapshot
Algorithm AS 247: Updating the Sufficient Configurations for Fitting ZPA Models to Multidimensional Contingency Tables
inferred← citeshttps://doi.org/10.31649/1999-9941-2023-56-1-30-34openalex-snapshot
NON-SEPARABLE BLOCK 9-BIT FAULT RESISTANT SINGLE ERROR CORRECTION CODES
inferred← citeshttps://doi.org/10.31979/etd.7qhs-rt9qopenalex-snapshot
Determination of a Graph's Chromatic Number for Part Consolidation in Axiomatic Design
inferred← citeshttps://doi.org/10.32657/10356/2526openalex-snapshot
Efficient mining of group patterns for mobile users
inferred← citeshttps://doi.org/10.32920/ryerson.14655771openalex-snapshot
Clique Listing Algorithms and Characteristics of Cliques in Random Graphics
inferred← citeshttps://doi.org/10.32920/ryerson.14655771.v1openalex-snapshot
Clique Listing Algorithms and Characteristics of Cliques in Random Graphics
inferred← citeshttps://doi.org/10.3389/fnetp.2022.924446openalex-snapshot
A simplicial analysis of the fMRI data from human brain dynamics under functional cognitive tasks
inferred← citeshttps://doi.org/10.3390/ijms232012462openalex-snapshot
Estimating the Similarity between Protein Pockets
inferred← citeshttps://doi.org/10.3390/jmse12101859openalex-snapshot
Graph Matching for Underwater Simultaneous Localization and Mapping Using Multibeam Sonar Imaging
inferred← citeshttps://doi.org/10.4230/dagsemproc.10441.2openalex-snapshot
Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time
inferred← citeshttps://doi.org/10.48550/arxiv.2007.15338openalex-snapshot
New approach to MPI program execution time prediction
inferred← citeshttps://doi.org/10.5121/ijdkp.2012.2204openalex-snapshot
Detecting Cliques Using Degree and Connectivity Constraints
inferred← citeshttps://doi.org/10.56155/978-81-955020-2-8-65openalex-snapshot
The Influence of Geometric Configurations: Exploring Hexagonal and Triangular Cycles in Social Graphs
inferred← citeshttps://doi.org/10.5772/intechopen.105637openalex-snapshot
Edge Computing - Technology, Management and Integration
inferred← citeshttps://doi.org/10.5772/intechopen.110178openalex-snapshot
Network Powered by Computing: Next Generation of Computational Infrastructure
inferred← citeshttps://doi.org/10.70675/25248cddz689az4f98z8bd2z381c02a454c3openalex-snapshot
When operations research meets structural pattern recognition : on the solution of error-tolerant graph matching problems
inferred← citeshttps://doi.org/10.70675/89f91833z2ccdz47cdz85dbzbc9afe37a96bopenalex-snapshot
A cost-driven approach for virtualized network Services Life-cycle Management
inferred← citeshttps://doi.org/10.7717/peerj-cs.2501openalex-snapshot
k-Clique counting on large scale-graphs: a survey
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.