Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices

DOI10.1016/j.jmp.2004.05.001zbMath1059.05082OpenAlexW2017516957MaRDI QIDQ1775813

Michael J. Brusco, J. Dennis Cradit

Publication date: 4 May 2005

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

Full work available at URL: https://doi.org/10.1016/j.jmp.2004.05.001

zbMATH Keywords

PartitioningGraph coloringCombinatorial data analysisConfusion matricesImplicit enumeration

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items (4)

A review of multiobjective programming and its application in quantitative psychology ⋮ Ising formulations of some graph-theoretic problems in psychological research: models and methods ⋮ Order-constrained solutions in \(K\)-means clustering: even better than being globally optimal ⋮ An Exact Algorithm for Blockmodeling of Two-Mode Network Data

Cites Work

• Role colouring a graph
• Some applications of graph theory to clustering
• The comparison and fitting of given classification schemes
• Min and max hierarchical clustering using asymmetric similarity measures
• How hard is it to determine if a graph has a 2-role assignment?
• Combinatorial Data Analysis
• A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
• Linear and circular unidimensional scaling for symmetric proximity matrices
• Cluster Analysis and Mathematical Programming
• Chromatic Scheduling and the Chromatic Number Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices