Minimal Partitions of a Graph

For a given graph G, we fix s, and partition the vertex set into s classes, so that any given class contains few edges. The result gives a partition (U1,

• Type: Journal
• Year: 1999
• Where: ARSCOM
• Authors: Thomas Dale Porter
• Keywords: ARSCOM 1999