2314 search results - page 77 / 463 » Minimal Partitions of a Graph |
COCOON
2005
Springer
15 years 6 months ago
2005
Springer
The Satisfactory Partition problem consists of deciding if a given graph has a partition of its vertex set into two nonempty parts such that each vertex has at least as many neighb...
114
click to vote
IPPS
2003
IEEE
15 years 6 months ago
2003
IEEE
Mesh partitioning is an important problem that has extensive applications in many areas. Multilevel algorithms are a successful class of optimization techniques which addresses th...
125
click to vote
EURODAC
1990
IEEE
15 years 5 months ago
1990
IEEE
In this paper an efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The ...
142
click to vote
FOCS
2000
IEEE
15 years 5 months ago
2000
IEEE
A bisection of a graph with n vertices is a partition of its vertices into two sets, each of size n/2. The bisection cost is the number of edges connecting the two sets. The proble...
112
click to vote
CVPR
2007
IEEE
16 years 3 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...