823 search results - page 54 / 165 » Brick partitions of graphs |
164
click to vote
CJCDGCGT
2005
Springer
15 years 8 months ago
2005
Springer
The vertex arboricity va(G) of a graph G is the minimum number of subsets into which the vertex set V (G) can be partitioned so that each subset induces an acyclic subgraph. The f...
165
click to vote
GECCO
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. Software clustering techniques are useful for extracting architectural information about a system directly from its source code structure. This paper starts by examining ...
164
click to vote
HICSS
2008
IEEE
16 years 17 days ago
2008
IEEE
A technique for clustering data by common attribute values involves grouping rows and columns of a binary matrix to make the minimum number of submatrices all 1’s. As binary mat...
188
click to vote
ECRTS
2010
IEEE
15 years 7 months ago
2010
IEEE
A full exploitation of the computational power available in a multi-core platform requires the software to be specified in terms of parallel execution flows. At the same time, mode...
224
click to vote
CORR
2011
Springer
14 years 9 months ago
2011
Springer
Abstract— We study algorithms for the SUBMODULAR MULTIWAY PARTITION problem (SUB-MP). An instance of SUB-MP consists of a finite ground set V , a subset S = {s1, s2, . . . , sk}...