3 search results - page 1 / 1 » Matrix Partitions with Finitely Many Obstructions |
80
Voted
COMBINATORICS
2007
14 years 10 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
102
Voted
DAM
2008
14 years 10 months ago
2008
Polar graphs are a common generalization of bipartite, cobipartite, and split graphs. They are defined by the existence of a certain partition of vertices, which is NPcomplete to ...
110
Voted
CSDA
2007
14 years 10 months ago
2007
Model-based clustering exploits finite mixture models for detecting group in a data set. It provides a sound statistical framework which can address some important issues, such as...