Pages that link to "Item:Q4773036"

The following pages link to SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES (Q4773036):

Displayed 14 items.

• Minimal superior ultrametrics under order constraint (Q913414) ‎ (← links)
• Circular-arc graphs with clique cover number two (Q1078197) ‎ (← links)
• Matrix reorganization and dynamic programming: applications to paired comparisons and unidimensional seriation (Q1162090) ‎ (← links)
• Restricted thresholds for interval orders: A case of nonaxiomatizability by a universal sentence (Q1163533) ‎ (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) ‎ (← links)
• Efficient parallel recognition of some circular arc graphs. I (Q1209733) ‎ (← links)
• Data analysis implications of some concepts related to the cuts of a graph (Q1237024) ‎ (← links)
• Constructing blockmodels: how and why (Q1245783) ‎ (← links)
• A generalized insertion algorithm for the seriation problem (Q1328867) ‎ (← links)
• Recognition of Robinsonian dissimilarities (Q1378872) ‎ (← links)
• The circumplex: a slightly stronger than ordinal approach. (Q1404968) ‎ (← links)
• Criteria for the global consistency of two-threshold preference relations in terms of forbidden subconfigurations (Q1813692) ‎ (← links)
• Double Semiorders and Double Indifference Graphs (Q3669466) ‎ (← links)
• The frame dimension and the complete overlap dimension of a graph (Q3705491) ‎ (← links)