Enumeration of the partitions with minimum diameter

DOI10.1016/0012-365X(93)90163-NzbMATH Open0782.05082MaRDI QIDQ686476FDOQ686476

Authors: Alain Guénoche 

Publication date: 5 January 1994

Published in: Discrete Mathematics (Search for Journal in Brave)

Recommendations

• scientific article; zbMATH DE number 867650
• scientific article; zbMATH DE number 617574
• scientific article; zbMATH DE number 736963
• scientific article; zbMATH DE number 3871421
• On the diameter of partition polytopes and vertex-disjoint cycle cover

zbMATH Keywords

partitionsNP-hardspanning subgraphcolouringscomplete valued graphminimum diameter

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph theory (05C99)

Cites Work

• New methods to color the vertices of a graph
• Cluster Analysis and Mathematical Programming
• Title not available (Why is that?)
• Chromatic Scheduling and the Chromatic Number Problem
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Minimum sum of diameters clustering
• Title not available (Why is that?)
• SPANNING TREES AND ASPECTS OF CLUSTERING
• Title not available (Why is that?)
• Enumeration of the partitions with minimum diameter

Cited In (8)

• Enumeration of the partitions with minimum diameter
• Minimum Perimeter-Sum Partitions in the Plane
• Cluster analysis and mathematical programming
• Title not available (Why is that?)
• Enumerating graph partitions without too small connected components using zero-suppressed binary and ternary decision diagrams
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Title not available (Why is that?)
• Graph coloring, minimum-diameter partitioning, and the analysis of confusion matrices

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)