SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
From MaRDI portal
(Redirected from Publication:4773036)
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
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
- An experimental comparison of seriation methods for one-mode two-way data
- Circular-arc graphs with clique cover number two
- The circumplex: a slightly stronger than ordinal approach.
- Double Semiorders and Double Indifference Graphs
- 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
- Data analysis implications of some concepts related to the cuts of a graph
- A Simple and Optimal Algorithm for Strict Circular Seriation
- 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)
