Data analysis implications of some concepts related to the cuts of a graph
type: Item
instance of: scholarly article
title: Data analysis implications of some concepts related to the cuts of a graph
zbMATH Open document ID: 0354.92047
DOI: 10.1016/0022-2496(77)90029-3
author: Lawrence Hubert
published in: Journal of Mathematical Psychology
publication date: 1977-01-01T00:00:00Z
Mathematics Subject Classification ID: 91E99
Mathematics Subject Classification ID: 91D99
Mathematics Subject Classification ID: 05Cxx
Mathematics Subject Classification ID: 94C10
zbMATH DE Number: 3552291
MaRDI profile type: Publication
full work available at URL: 0022-2496(77)90029-3
OpenAlex ID: W2062206866
cites work: Optimal Linear Ordering
cites work: Q5654754
cites work: Q5514188
cites work: Multi-Terminal Network Flows
cites work: Parallel concepts in graph theory
cites work: SPANNING TREES AND ASPECTS OF CLUSTERING
cites work: SOME APPLICATIONS OF GRAPH THEORY AND RELATED NON‐METRIC TECHNIQUES TO PROBLEMS OF APPROXIMATE SERIATION: THE CASE OF SYMMETRIC PROXIMITY MEASURES
cites work: Some applications of graph theory to clustering
cites work: Optimum Communication Spanning Trees
cites work: Q4085109
cites work: Hierarchical clustering schemes
cites work: Q4142699
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: k-Components, Clusters and Slicings in Graphs
cites work: Q5670102
cites work: Q4138743
description: scientific article; zbMATH DE number 3552291