1512 search results - page 80 / 303 » connection 2006 |
100
click to vote
CPC
2006
14 years 9 months ago
2006
We consider instances of the maximum independent set problem that are constructed according to the following semirandom model. Let Gn,p be a random graph, and let S be a set consis...
ENTCS
2006
14 years 9 months ago
2006
We introduce a simple graph logic that supports specification of Quality of Service (QoS) properties of applications. The idea is that we are not only interested in representing w...
IPL
2007
14 years 9 months ago
2007
The (k − 1)-fault diameter Dk(G) of a k-connected graph G is the maximum diameter of an induced subgraph by deleting at most k − 1 vertices from G. This paper considers the fa...
ISCI
2007
14 years 9 months ago
2007
In this paper, we explore the 2-extra connectivity and 2-extra-edge-connectivity of the folded hypercube FQn. We show that j2(FQn) = 3n À 2 for n P 8; and k2(FQn) = 3n À 1 for n...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
The novel design of an efficient FPGA interconnection architecture with multiple Switch Boxes (SB) and hardwired connections for realizing data intensive applications (i.e. DSP ap...