Multidimensional scaling and threshold graphs

DOI10.1016/0022-2496(87)90014-9zbMath0649.92021OpenAlexW2068683531MaRDI QIDQ1106142

Margaret B. Cozzens, Rochelle Leibowitz

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0022-2496(87)90014-9

zbMATH Keywords

fast algorithmsunionsintersectionspolynomial time algorithmsthreshold graphmultidimensional scalingbiorderscomputational complexity. Coens, Margaret B.extended Guttman scaleLeibowitz, Rochelllevels of dominationsoperations on scales

Mathematics Subject Classification ID

Graph theory (05C99) Mathematical psychology (91E99) Applications of statistics to psychology (62P15)

Related Items

An \(O(n^3)\) time algorithm for recognizing threshold dimension 2 graphs ⋮ Double-threshold permutation graphs ⋮ On dimensional properties of graphs ⋮ Certifying fully dynamic algorithms for recognition and Hamiltonicity of threshold and chain graphs ⋮ Bipartite bithreshold graphs ⋮ On the complexity of the k-chain subgraph cover problem ⋮ The relationship between the threshold dimension of split graphs and various dimensional parameters

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On realizable biorders and the biorder dimension of a relation
• Ferrers digraphs and threshold graphs
• Composite measurement
• Threshold Dimension of Graphs
• The Complexity of the Partial Order Dimension Problem
• Double Semiorders and Double Indifference Graphs
• On a Digraph Dimension
• Threshold Sequences
• Linear Separation of Dominating Sets in Graphs
• A Note on "The Comparability Graph of a Tree"