3268 search results - page 484 / 654 » The hub number of a graph |
IJBC
2007
15 years 6 months ago
2007
In this paper we present a model of impact dynamics in large dimensional systems. We describe a hybrid method, based on graph theory and probability theory, which enables us quali...
182
click to vote
ISI
2007
Springer
15 years 6 months ago
2007
Springer
ABSTRACT. Grids have become very complex. It makes the deployment and maintenance of systems a difficult task requiring lots of efforts from administrators. We believe that peer-t...
179
click to vote
TVLSI
2008
15 years 6 months ago
2008
Abstract--In this paper, we introduce a novel substrate noise estimation technique during early floorplanning for mixed signal system-on-chip (SOC), based on block preference direc...
153
click to vote
CI
1998
15 years 6 months ago
1998
A pattern database is a lookup table that stores an exact evaluation function for a relaxed search problem, which provides an admissible heuristic for the original search problem....
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...