316 search results - page 21 / 64 » On almost self-complementary graphs |
PERCOM
2006
ACM
15 years 11 months ago
2006
ACM
A recent flooding algorithm [1] guaranteed correctness for networks with dynamic edges and fixed nodes. The algorithm provided a partial answer to the highly dynamic network (HDN)...
ICCD
2004
IEEE
15 years 8 months ago
2004
IEEE
Formal and dynamic (simulation, emulation, etc.) verification techniques are both needed to deal with the overall challenge of verification. Ideally, the same specification/tes...
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
Multi-core processors are a shift of paradigm in computer architecture that promises a dramatic increase in performance. But multi-core processors also bring an unprecedented leve...
CSR
2007
Springer
15 years 6 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...
107
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
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,...