Data analysis implications of some concepts related to the cuts of a graph
From MaRDI portal
Publication:1237024
DOI10.1016/0022-2496(77)90029-3zbMath0354.92047OpenAlexW2062206866MaRDI QIDQ1237024
Publication date: 1977
Published in: Journal of Mathematical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0022-2496(77)90029-3
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (5)
On the use of ordered sets in problems of comparison and consensus of classifications ⋮ The weighted sum of split and diameter clustering ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Maximum sum-of-splits clustering ⋮ Clusterwise p* models for social network analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Some applications of graph theory to clustering
- Parallel concepts in graph theory
- Hierarchical clustering schemes
- Optimum Communication Spanning Trees
- Multi-Terminal Network Flows
- SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
- SPANNING TREES AND ASPECTS OF CLUSTERING
- Optimal Linear Ordering
- k-Components, Clusters and Slicings in Graphs
This page was built for publication: Data analysis implications of some concepts related to the cuts of a graph
