5606 search results - page 208 / 1122 » Randomization Techniques for Graphs. |
MFCS
2004
Springer
15 years 6 months ago
2004
Springer
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
140
Voted
COMBINATORICS
2006
15 years 24 days ago
2006
For undirected graphs it has been known for some time that one can bound the diameter using the eigenvalues. In this note we give a similar result for the diameter of strongly con...
146
Voted
JSS
2010
14 years 11 months ago
2010
Random testing is not only a useful testing technique in itself, but also plays a core role in many other testing methods. Hence, any significant improvement to random testing ha...
113
click to vote
CASES
2006
ACM
15 years 6 months ago
2006
ACM
Random access memory (RAM) is tightly-constrained in many embedded systems. This is especially true for the least expensive, lowest-power embedded systems, such as sensor network ...
84
Voted
COMBINATORICS
2004
15 years 18 days ago
2004
We construct smallest known trivalent graphs for girths 16 and 18. One construction uses voltage graphs, and the other coset enumeration techniques for group presentations. AMS Su...