SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES

DOI10.1111/J.2044-8317.1974.TB00534.XzbMATH Open0285.92029OpenAlexW2016378139MaRDI QIDQ4773036FDOQ4773036

Authors: Lawrence Hubert 

Publication date: 1974

Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1111/j.2044-8317.1974.tb00534.x

Mathematics Subject Classification ID

Mathematical psychology (91E99) Graph theory (05Cxx)

Cited In (28)

• Hadwiger's conjecture for proper circular arc graphs
• Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
• An optimal algorithm to recognize Robinsonian dissimilarities
• An experimental comparison of seriation methods for one-mode two-way data
• Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
• Double Semiorders and Double Indifference Graphs
• Circular-arc graphs with clique cover number two
• The circumplex: a slightly stronger than ordinal approach.
• Compact integer-programming models for extracting subsets of stimuli from confusion matrices
• The frame dimension and the complete overlap dimension of a graph
• Recognition of Robinsonian dissimilarities
• Disentangling relationships in symptom networks using matrix permutation methods
• A Simple and Optimal Algorithm for Strict Circular Seriation
• Data analysis implications of some concepts related to the cuts of a graph
• Modules in Robinson Spaces
• On Robinsonian dissimilarities, the consecutive ones property and latent variable models
• A generalized insertion algorithm for the seriation problem
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation
• Two-way incremental seriation in the temporal domain with three-dimensional visualization: making sense of evolving high-dimensional datasets
• Minimal superior ultrametrics under order constraint
• Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations
• Two simple but efficient algorithms to recognize Robinson dissimilarities
• Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence
• Characterizations and recognition of circular-arc graphs and subclasses: a survey
• Efficient parallel recognition of some circular arc graphs. I
• Constructing blockmodels: how and why
• An interactive multiobjective programming approach to combinatorial data analysis
• Representations of graphs and networks (coding, layouts and embeddings)

This page was built for publication: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4773036)