817 search results - page 45 / 164 » On 2-factors with k components |
159
click to vote
WSC
1998
15 years 7 months ago
1998
In this paper, we propose two speculation-based methods for fast and accurate simulation-based performance and dependability analysis of complex systems, incorporating detailed si...
155
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
A simple 2-matching in a graph is a subgraph all of whose nodes have degree 1 or 2. A simple 2-matching is called k-restricted if every connected component has > k edges. We co...
199
click to vote
ACMIDC
2011
14 years 9 months ago
2011
LightUp is a constructionist platform to teach novices about electronics, and also a low-cost rapid-prototyping platform for more advanced users. The LightUp kit contains many bas...
160
click to vote
DCC
2006
IEEE
16 years 5 months ago
2006
IEEE
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
161
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...