1951 search results - page 61 / 391 » An algorithm for improving graph partitions |
117
click to vote
IPPS
2006
IEEE
15 years 10 months ago
2006
IEEE
This paper presents a parallel framework of grid-based numerical algorithms where data dependencies between grid zones can be modeled by a directed acyclic graph (DAG). It consist...
153
click to vote
DAM
2008
15 years 4 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 ...
132
click to vote
MICCAI
2005
Springer
16 years 4 months ago
2005
Springer
Shape priors attempt to represent biological variations within a population. When variations are global, Principal Component Analysis (PCA) can be used to learn major modes of vari...
169
click to vote
WAW
2010
Springer
15 years 1 months ago
2010
Springer
We give algorithms for finding graph clusters and drawing graphs, highlighting local community structure within the context of a larger network. For a given graph G, we use the per...
133
click to vote
DAC
1994
ACM
15 years 8 months ago
1994
ACM
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...