3757 search results - page 85 / 752 » The overlap number of a graph |
155
click to vote
ICPR
2000
IEEE
15 years 10 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...
165
click to vote
INFORMATICALT
2007
15 years 6 months ago
2007
In this paper we recall the notion of weakly decomposition, we recall some necessary and sufficient conditions for a graph to admit such a decomposition, we introduce the recognit...
167
click to vote
GC
2010
Springer
15 years 4 months ago
2010
Springer
In 1966 Barnette introduced a set of graphs, called circuit graphs, which are obtained from 3-connected planar graphs by deleting a vertex. Circuit graphs and 3-connected planar g...
156
click to vote
OPODIS
2008
15 years 7 months ago
2008
The process number is the minimum number of requests that have to be simultaneously disturbed during a routing reconfiguration phase of a connection oriented network. From a graph ...
167
click to vote
JCT
2011
15 years 1 months ago
2011
The f-regressive Ramsey number Rreg f (d, n) is the minimum N such that every colouring of the d-tuples of an N-element set mapping each x1, . . . , xd to a colour ≤ f(x1) contai...