1512 search results - page 13 / 303 » connection 2006 |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
IJON
2006
14 years 9 months ago
2006
The goal of the visual correspondence problem is to establish a connectivity pattern (a mapping) between two images such that features projected from the same scene point are conn...
COMBINATORICS
2002
14 years 9 months ago
2002
We present a simple heuristic for finding a small connected dominating set of cubic graphs. The average-case performance of this heuristic, which is a randomised greedy algorithm,...
IPL
2010
14 years 7 months ago
2010
We show that any face hitting set of size n of a connected planar graph with a minimum degree of at least 3 is contained in a connected subgraph of size 5n − 6. Furthermore we s...
ENDM
2006
14 years 9 months ago
2006
A graph is hypohamiltonian if it is not hamiltonian but every vertex-deleted subgraph is. In this paper we study hypohamiltonian snarks