823 search results - page 8 / 165 » Brick partitions of graphs |
111
click to vote
JCO
2007
15 years 28 days ago
2007
Let Kn1,n2,...,nm be a complete m-partite graph with partite sets of sizes n1,n2,...,nm. A complete m-partite graph is balanced if each partite set has n vertices. We denote this c...
119
Voted
ICML
2004
IEEE
16 years 1 months ago
2004
IEEE
A critical problem in cluster ensemble research is how to combine multiple clusterings to yield a final superior clustering result. Leveraging advanced graph partitioning techniqu...
67
Voted
JGT
2006
15 years 1 months ago
2006
: A graph has the neighbor-closed-co-neighbor, or ncc property, if for each of its vertices x, the subgraph induced by the neighbor set of x is isomorphic to the subgraph induced b...
122
click to vote
WG
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Assume that each vertex of a graph G is assigned a nonnegative integer weight and that l and u are nonnegative integers. One wish to partition G into connected components...
119
click to vote
ICCV
2003
IEEE
16 years 2 months ago
2003
IEEE
Vision tasks, such as segmentation, grouping, recognition, can be formulated as graph partition problems. The recent literature witnessed two popular graph cut algorithms: the Ncu...