On the public citation graph
A graph-theoretic method for organizing overlapping clusters into trees, multiple trees, or extended trees
0 signed · 36 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/978-3-322-96310-9openalex-snapshot
Graphs as Structural Models
inferredcites →https://doi.org/10.1007/bf00991836openalex-snapshot
Cliques of a graph-variations on the Bron-Kerbosch algorithm
inferredcites →https://doi.org/10.1007/bf02248731openalex-snapshot
Clique detection for nondirected graphs: Two new algorithms
inferredcites →https://doi.org/10.1007/bf02294012openalex-snapshot
Indclus: An Individual differences Generalization of the Adclus Model and the Mapclus Algorithm
inferredcites →https://doi.org/10.1007/bf02294077openalex-snapshot
MACPLUS: A Mathematical Programming Approach to Fitting the ADCLUS Model
inferredcites →https://doi.org/10.1007/bf02296969openalex-snapshot
Spatial, Non-Spatial and Hybrid Models for Scaling
inferredcites →https://doi.org/10.1016/0022-2496(78)90029-9openalex-snapshot
Free trees and bidirectional trees as representations of psychological distance
inferredcites →https://doi.org/10.1016/0045-7906(79)90002-8openalex-snapshot
Magnitude ordering of degree complements of certain node pairs in an undirected graph and an algorithm to find a class of maximal subgraphs
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.1037//0033-295x.86.2.87openalex-snapshot
Additive clustering: Representation of similarities as combinations of discrete overlapping properties.
inferredcites →https://doi.org/10.1037//0033-295x.94.1.16openalex-snapshot
On the relation between common and distinctive feature models.
inferredcites →https://doi.org/10.1080/00207169008803851openalex-snapshot
A global optimization approach for solving the maximum clique problem
inferredcites →https://doi.org/10.1109/31.55076openalex-snapshot
Global optimization: a naive approach
inferredcites →https://doi.org/10.1137/0206036openalex-snapshot
A New Algorithm for Generating All the Maximal Independent Sets
inferredcites →https://doi.org/10.1137/0215075openalex-snapshot
Finding a Maximum Clique in an Arbitrary Graph
inferredcites →https://doi.org/10.1145/362342.362367openalex-snapshot
Algorithm 457: finding all cliques of an undirected graph
inferredcites →https://doi.org/10.1207/s15327906mbr1004_7openalex-snapshot
The Method of Sorting as a Data-Gathering Procedure in Multivariate Research
inferredcites →https://doi.org/10.2307/2531522openalex-snapshot
Graphs as Structural Models: The Application of Graphs and Multigraphs in Cluster Analysis.
inferredcites →https://doi.org/10.4135/9781412986359openalex-snapshot
Three-way Scaling and Clustering
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-60392-1_21openalex-snapshot
Representational structures for cognitive space: Trees, ordered trees and semi-lattices
inferred← citeshttps://doi.org/10.1007/978-4-431-65950-1_44openalex-snapshot
Classification Structures for Cognitive Maps
inferred← citeshttps://doi.org/10.1007/s00357-012-9117-0openalex-snapshot
J. Douglas Carroll 1939–2011
inferred← citeshttps://doi.org/10.1007/s11135-011-9497-yopenalex-snapshot
Extracting cover sets from free fuzzy sorting data
inferred← citeshttps://doi.org/10.1007/s11336-012-9289-xopenalex-snapshot
In memoriam, J. Douglas Carroll
inferred← citeshttps://doi.org/10.1016/b978-0-12-818630-5.10072-7openalex-snapshot
Clustering approaches
inferred← citeshttps://doi.org/10.1016/b978-012099975-0.50005-1openalex-snapshot
Multidimensional Scaling
inferred← citeshttps://doi.org/10.1080/00273171.2017.1391682openalex-snapshot
Detecting Clusters/Communities in Social Networks
inferred← citeshttps://doi.org/10.1177/002224379803500201openalex-snapshot
Distance Representations of Consumer Perceptions: Evaluating Appropriateness by Using Diagnostics
inferred← citeshttps://doi.org/10.1177/076737019901400405openalex-snapshot
Représentation des distances perceptuelles des consommateurs : évaluation des modèles de représentation par des indicateurs de diagnostic
inferred← citeshttps://doi.org/10.1348/000711005x64240openalex-snapshot
Estimating standard errors in feature network models
inferred← citeshttps://doi.org/10.1348/000711006x119365openalex-snapshot
Feature selection in feature network models: Finding predictive subsets of features with the Positive Lasso
inferred← citeshttps://doi.org/10.3758/bf03196256openalex-snapshot
Extending the ALCOVE model of category learning to featural stimulus domains
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.