1591 search results - page 16 / 319 » Random lifts of graphs |
APPROX
2008
Springer
14 years 11 months ago
2008
Springer
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
DM
2008
14 years 10 months ago
2008
For any graph G, the k-improper chromatic number k (G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree ...
DM
2007
14 years 9 months ago
2007
The main aim of this short paper is to answer the following question. Given a fixed graph H, for which values of the degree d does a random d-regular graph on n vertices contain ...
COMBINATORICS
2002
14 years 9 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,...
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...