On the public citation graph
A clique-detection algorithm based on neighborhoods in graphs
0 signed · 29 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.1093/comjnl/11.2.177openalex-snapshot
The Construction of Hierarchic and Non-Hierarchic Classifications
inferredcites →https://doi.org/10.1145/321479.321480openalex-snapshot
Semantic Clustering of Index Terms
inferredcites →https://doi.org/10.1145/321607.321608openalex-snapshot
An Analysis of Some Graph Theoretical Cluster Techniques
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-4613-9883-7_4openalex-snapshot
Clustering Analysis and Its Applications
inferred← citeshttps://doi.org/10.1007/978-1-4757-3023-4_1openalex-snapshot
The Maximum Clique Problem
inferred← citeshttps://doi.org/10.1007/bf00991836openalex-snapshot
Cliques of a graph-variations on the Bron-Kerbosch algorithm
inferred← citeshttps://doi.org/10.1016/0734-189x(89)90072-8openalex-snapshot
A framework for estimation of motion parameters from range images
inferred← citeshttps://doi.org/10.1016/j.ipl.2017.05.005openalex-snapshot
A linear time algorithm for maximal clique enumeration in large sparse graphs
inferred← citeshttps://doi.org/10.1016/j.parco.2019.05.005openalex-snapshot
A memory efficient maximal clique enumeration method for sparse graphs with a parallel implementation
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.1109/jproc.2020.2977595openalex-snapshot
A Tutorial on Clique Problems in Communications and Signal Processing
inferred← citeshttps://doi.org/10.1109/secon.1989.132463openalex-snapshot
An algorithm for determining pattern connectivity and cluster compactness
inferred← citeshttps://doi.org/10.1109/tkde.2023.3311398openalex-snapshot
Incremental Maximal Clique Enumeration for Hybrid Edge Changes in Large Dynamic Graphs
inferred← citeshttps://doi.org/10.1109/tpami.1984.4767592openalex-snapshot
Matching Images Using Linear Features
inferred← citeshttps://doi.org/10.1109/uksim.2008.23openalex-snapshot
Biological Network Simulation Using Holonic Multiagent Systems
inferred← citeshttps://doi.org/10.1134/s1064226915120177openalex-snapshot
Combinatorial clustering: Literature review, methods, examples
inferred← citeshttps://doi.org/10.1145/1458082.1458288openalex-snapshot
Large maximal cliques enumeration in sparse graphs
inferred← citeshttps://doi.org/10.1147/jrd.2010.2081230openalex-snapshot
Discovery and analysis of tightly knit communities in telecom social networks
inferred← citeshttps://doi.org/10.15388/informatica.2012.366openalex-snapshot
Towards Clique-Based Fusion of Graph Streams in Multi-Function System Testing
inferred← citeshttps://doi.org/10.48550/arxiv.1103.3807openalex-snapshot
Framework for Clique-based Fusion of Graph Streams in Multi-function System Testing
inferred← citeshttps://doi.org/10.6100/ir642929openalex-snapshot
A composable and predictable on-chip interconnect
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.