Sciweavers

COMBINATORICS   2002
Wall of Fame | Most Viewed COMBINATORICS-2002 Paper
COMBINATORICS
2002
136views more  COMBINATORICS 2002»
13 years 6 months ago
Minimum Connected Dominating Sets of Random Cubic Graphs
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,...
William Duckworth
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source136
2Download preprint from source116
3Download preprint from source113
4Download preprint from source111
5Download preprint from source109
6Download preprint from source107
7Download preprint from source105
8Download preprint from source104
9Download preprint from source102
10Download preprint from source99
11Download preprint from source99
12Download preprint from source97
13Download preprint from source93
14Download preprint from source92
15Download preprint from source92
16Download preprint from source92
17Download preprint from source90
18Download preprint from source89
19Download preprint from source89
20Download preprint from source88
21Download preprint from source88
22Download preprint from source87
23Download preprint from source87
24Download preprint from source86
25Download preprint from source86
26Download preprint from source85
27Download preprint from source85
28Download preprint from source84
29Download preprint from source83
30Download preprint from source83
31Download preprint from source83
32Download preprint from source82
33Download preprint from source82
34Download preprint from source82
35Download preprint from source81
36Download preprint from source80
37Download preprint from source79
38Download preprint from source77
39Download preprint from source77
40Download preprint from source77
41Download preprint from source76
42Download preprint from source76
43Download preprint from source75
44Download preprint from source74
45Download preprint from source73
46Download preprint from source73
47Download preprint from source73
48Download preprint from source72
49Download preprint from source71
50Download preprint from source71
51Download preprint from source71
52Download preprint from source70
53Download preprint from source69
54Download preprint from source69
55Download preprint from source69
56Download preprint from source68
57Download preprint from source68
58Download preprint from source68
59Download preprint from source67
60Download preprint from source65
61Download preprint from source65
62Download preprint from source64
63Download preprint from source63
64Download preprint from source62
65Download preprint from source62
66Download preprint from source60
67Download preprint from source59
68Download preprint from source59
69Download preprint from source58
70Download preprint from source56
71Download preprint from source54
72Download preprint from source52
73Download preprint from source51