250 search results - page 28 / 50 » Fixed Argument Pairings |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
EJC
2006
13 years 10 months ago
2006
A tube (resp. an oval tube) in PG(3, q) is a pair T = {L, L}, where {L} L is a collection of mutually disjoint lines of PG(3, q) such that for each plane of PG(3, q) containing L...
COMBINATORICS
2004
13 years 9 months ago
2004
It is shown that if a d-regular graph contains s vertices so that the distance between any pair is at least 4k, then its adjacency matrix has at least s eigenvalues which are at l...
CORR
2004
Springer
13 years 9 months ago
2004
Springer
A (k, t)-track layout of a graph G consists of a (proper) vertex t-colouring of G, a total order of each vertex colour class, and a (non-proper) edge k-colouring such that between...
ICCV
2001
IEEE
14 years 11 months ago
2001
IEEE
Window size and shape selection is a difficult problem in area based stereo. We propose an algorithm which chooses an appropriate window shape by optimizing over a large class of ...