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

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

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)

Cites Work

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

Cited In (4)

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

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)