SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
From MaRDI portal
Publication:4773036
DOI10.1111/j.2044-8317.1974.tb00534.xzbMath0285.92029OpenAlexW2016378139MaRDI QIDQ4773036
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
Related Items (27)
An optimal algorithm to recognize Robinsonian dissimilarities ⋮ Circular-arc graphs with clique cover number two ⋮ A generalized insertion algorithm for the seriation problem ⋮ A Simple and Optimal Algorithm for Strict Circular Seriation ⋮ The frame dimension and the complete overlap dimension of a graph ⋮ Disentangling relationships in symptom networks using matrix permutation methods ⋮ Recognition of Robinsonian dissimilarities ⋮ The circumplex: a slightly stronger than ordinal approach. ⋮ Modules in Robinson Spaces ⋮ Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances ⋮ Minimal superior ultrametrics under order constraint ⋮ Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation ⋮ Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence ⋮ On Robinsonian dissimilarities, the consecutive ones property and latent variable models ⋮ Representations of graphs and networks (coding, layouts and embeddings) ⋮ An experimental comparison of seriation methods for one-mode two-way data ⋮ Efficient parallel recognition of some circular arc graphs. I ⋮ Data analysis implications of some concepts related to the cuts of a graph ⋮ Constructing blockmodels: how and why ⋮ An interactive multiobjective programming approach to combinatorial data analysis ⋮ Compact integer-programming models for extracting subsets of stimuli from confusion matrices ⋮ Two-way incremental seriation in the temporal domain with three-dimensional visualization: making sense of evolving high-dimensional datasets ⋮ Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations ⋮ Hadwiger's conjecture for proper circular arc graphs ⋮ Characterizations and recognition of circular-arc graphs and subclasses: a survey ⋮ Double Semiorders and Double Indifference Graphs ⋮ Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices
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
