Enumeration of the partitions with minimum diameter
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4013781 (Why is no real title available?)
- scientific article; zbMATH DE number 3672307 (Why is no real title available?)
- scientific article; zbMATH DE number 867650 (Why is no real title available?)
- Chromatic Scheduling and the Chromatic Number Problem
- Cluster Analysis and Mathematical Programming
- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Enumeration of the partitions with minimum diameter
- Minimum sum of diameters clustering
- New methods to color the vertices of a graph
- SPANNING TREES AND ASPECTS OF CLUSTERING
Cited in
(8)- Efficient algorithms for divisive hierarchical clustering with the diameter criterion
- Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams
- scientific article; zbMATH DE number 736963 (Why is no real title available?)
- Cluster analysis and mathematical programming
- scientific article; zbMATH DE number 5237271 (Why is no real title available?)
- Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices
- Enumeration of the partitions with minimum diameter
- Minimum Perimeter-Sum Partitions in the Plane
This page was built for publication: Enumeration of the partitions with minimum diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q686476)