5606 search results - page 185 / 1122 » Randomization Techniques for Graphs. |
110
Voted
PERCOM
2005
ACM
16 years 8 days ago
2005
ACM
When analyzing dissemination protocols in mobile adhoc networks the underlying mobility model is an important factor because it strongly influences the performance of these protoc...
102
Voted
APPROX
1998
Springer
15 years 5 months ago
1998
Springer
We present randomized approximation algorithms for the circular arc graph colouring problem and for the problem of bandwidth allocation in all-optical ring networks. We obtain a fa...
SIAMDM
2008
15 years 18 days ago
2008
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n 2ck contains a K4 whose edges receive at most two colors. Th...
123
Voted
ICALP
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We deal with two intimately related subjects: quasi-randomness and regular partitions. The purpose of the concept of quasi-randomness is to measure how much a given graph...
92
Voted
SIAMDM
2010
14 years 7 months ago
2010
The firefighter problem is the following discrete-time game on a graph. Initially, a fire starts at a vertex of the graph. In each round, a firefighter protects one vertex not yet ...