3757 search results - page 584 / 752 » The overlap number of a graph |
143
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
![A [k, k+1]-Factor Containing A Given Hamiltonian Cycle](http://sciweavers.com/files/imagecache/thumbnail/imagecache/a_k_k_1_factor_containing_a_given_hamiltonian_cycle_COMBINATORICS_1999.jpg "A [k, k+1]-Factor Containing A Given Hamiltonian Cycle")
We prove the following best possible result. Let k 2 be an integer and G be a graph of order n with minimum degree at least k. Assume n 8k - 16 for even n and n 6k-13 for odd n...
153
click to vote
RSA
2002
15 years 6 months ago
2002
Let be a finite index set and k 1 a given integer. Let further S []k be an arbitrary family of k element subsets of . Consider a (binomial) random subset p of , where p = (pi :...
152
click to vote
TKDE
2002
15 years 6 months ago
2002
We introduce ImageMap, as a method for indexing and similarity searching in Image DataBases (IDBs). ImageMap answers "queries by example", involving any number of object...
178
click to vote
ATMOS
2010
15 years 5 months ago
2010
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
182
click to vote
ECCC
2010
15 years 5 months ago
2010
Bodlaender’s Theorem states that for every k there is a linear-time algorithm that decides whether an input graph has tree width k and, if so, computes a width-k tree compositio...