Coloring Sparse Random Graphs in Polynominal Average Time
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Algorithms for Colouring Random k-colourable Graphs
Combinatorics, Probability and Computing
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Coloring random 3-colorable graphs with non-uniform edge probabilities
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |