2314 search results - page 208 / 463 » Minimal Partitions of a Graph |
130
click to vote
ICPR
2000
IEEE
15 years 8 months ago
2000
IEEE
We describe a graph-based global registration method for creating 2D mosaic images. When multi-frames overlap in space, global registration is necessary to minimize the accumulate...
130
click to vote
ECCC
2008
15 years 4 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
139
click to vote
ENTCS
2008
15 years 4 months ago
2008
We describe a method for proving the termination of graph transformation systems. The method is based on the fact that infinite reductions must include infinite `creation chains&#...
155
click to vote
JCO
2008
15 years 4 months ago
2008
Minimum m-connected k-dominating set problem is as follows: Given a graph G = (V,E) and two natural numbers m and k, find a subset S V of minimal size such that every vertex in V ...
128
click to vote
TIP
2008
15 years 4 months ago
2008
We provide a detailed analysis of the use of minimal spanning graphs as an alignment method for registering multimodal images. This yields an efficient graph theoretic algorithm th...