A graph theoretic approach to the grouping of ordering data

DOI10.1002/net.3230020404zbMath0252.68011OpenAlexW2013075098MaRDI QIDQ5666148

Lawrence Bodin

Publication date: 1972

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230020404

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Related Items (2)

A recursive Lagrangian method for clustering problems ⋮ Clustering to minimize the maximum intercluster distance

This page was built for publication: A graph theoretic approach to the grouping of ordering data