2314 search results - page 234 / 463 » Minimal Partitions of a Graph |
143
click to vote
GECCO
2006
Springer
15 years 8 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
178
click to vote
RSP
2000
IEEE
15 years 8 months ago
2000
IEEE
Dataflow programming has proven to be popular for representing applications in rapid prototyping tools for digital signal processing (DSP); however, existing dataflow design tools...
138
click to vote
JAL
2006
15 years 4 months ago
2006
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it...
133
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
123
click to vote
ISBI
2009
IEEE
15 years 11 months ago
2009
IEEE
Understanding neural connectivity and structures in the brain requires detailed 3D anatomical models, and such an understanding is essential to the study of the nervous system. Ho...