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

DOI10.1016/J.JMP.2004.05.001zbMATH Open1059.05082OpenAlexW2017516957MaRDI QIDQ1775813FDOQ1775813

Authors 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

Graph coloringPartitioningCombinatorial data analysisConfusion matricesImplicit enumeration

Mathematics Subject Classification ID

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

Recommendations

• Enumeration of the partitions with minimum diameter
• Constructive Heuristics and Lower Bounds for Graph Partitioning Based on a Principal-Components Approximation
• scientific article; zbMATH DE number 736963
• Comparison of algorithms in graph partitioning
• scientific article; zbMATH DE number 3867385

Cites work

• scientific article; zbMATH DE number 4022343 (Why is no real title available?)
• scientific article; zbMATH DE number 3672307 (Why is no real title available?)
• scientific article; zbMATH DE number 1302393 (Why is no real title available?)
• scientific article; zbMATH DE number 1983913 (Why is no real title available?)
• scientific article; zbMATH DE number 4189544 (Why is no real title available?)
• scientific article; zbMATH DE number 3043302 (Why is no real title available?)
• A Graph-Theoretic Approach to Goodness-of-Fit in Complete-Link Hierarchical Clustering
• Chromatic Scheduling and the Chromatic Number Problem
• Cluster Analysis and Mathematical Programming
• Combinatorial data analysis. Optimization by dynamic programming
• How hard is it to determine if a graph has a 2-role assignment?
• Linear and circular unidimensional scaling for symmetric proximity matrices
• Min and max hierarchical clustering using asymmetric similarity measures
• Role colouring a graph
• Some applications of graph theory to clustering
• The comparison and fitting of given classification schemes

Cited in

(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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1775813)