Enumeration of the partitions with minimum diameter

DOI10.1016/0012-365X(93)90163-NzbMath0782.05082MaRDI QIDQ686476

Alain Guénoche

Publication date: 5 January 1994

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

zbMATH Keywords

partitionsNP-hardcolouringsspanning subgraphcomplete valued graphminimum diameter

Mathematics Subject Classification ID

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

Related Items (3)

Cluster analysis and mathematical programming ⋮ Efficient algorithms for divisive hierarchical clustering with the diameter criterion ⋮ Enumeration of the partitions with minimum diameter

Cites Work

• Minimum sum of diameters clustering
• Enumeration of the partitions with minimum diameter
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• New methods to color the vertices of a graph
• SPANNING TREES AND ASPECTS OF CLUSTERING
• Cluster Analysis and Mathematical Programming
• Chromatic Scheduling and the Chromatic Number Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Enumeration of the partitions with minimum diameter