Coloring in sublinear time

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1284, Issue , 1997, Pages 388-401

  Nolte, Andreas ^a   Schrader, Rainer ^a  

^a UNIVERSITY OF COLOGNE   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SIMULATED ANNEALING;

GRAPH COLORING PROBLEM; HIGH PROBABILITY; SAMPLING PROCEDURES; SUBLINEAR TIME;

GRAPH ALGORITHMS;

EID: 21744437681     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-63397-9_30     Document Type: Conference Paper

References (18)

1. Alon, N.; Kahale. N.: A spectral technique for coloring random 3-colorable graphs, Proceedings of the 26th Symposium on Theory of Computing, 1994
2. Angluin, D.; Valiant, L.G.: Fast probabilistic algorithms for Hamiltonian circuits and matchings, Journal of Computer System Science 18, 1979
3. Blum, A.; Spencer, J.: Coloring Random and Semi-Random k-Colorable graphs, Journal of Algorithms 19, 1995
4. Chung, K.L.: Markov chains with stationary transition probabilities, Springer Verlag, Heidelberg, 1960.
5. Dyer, M.; Frieze, A.: The Solution of Some Random NP-Hard Problems in Polynomial Expected Time, Journal of Algorithms 10, 1989
6. Feller, W.: An introduction to probability theory and its applications, Volume 1, John Wiley & Sons, New York, 1950
7. Garey, M.R.; Johnson, S.J.: Computers and Intractability, W.H. Freeman and Company, 1979
8. Jensen, T.; Toft, B.: Graph Coloring Problems, John Wiley & Sons, 1995
9. Jerrum, J; Sorkin, G.: Simulated Annealing for Graph Bisection, Technical Report 1993, LFCS, University of Edinburgh
10. Johnson, D.S.; Aragon, C.R.; McGeoch, L.A.; Schevon, C.: Optimization by Simulated Annealing: An Experimental Evaluation, Operations Research 39, 1991
11. Kirkpatrick, S.; Gelatt, C.D.; Vecchi, M.P.: Optimization by Simulated Annealing, Science 220, 1983.
12. Kucera, L.: Expected behaviour of graph coloring algorithms, Lecture Notes in Computer Science 56, 1977
13. Laarhoven, P.J.M.; Aarts, E.H.L.: Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, 1989.
14. Lindvall, T.: Lectures on the Coupling method, John Wiley & Sons, 1992
15. Metropolis, N.; Rosenbluth, M.; Rosenbluth, M.; Teller, A.; Teller, E.: Equation of state calculations by fast computer machines, Journal of Chemical Physics 21, 1953
16. Petford, A.D.; Welsh, D.J.A.: A Randomized 3-Coloring Algorithm, Discrete Mathematics 74 (1989), North Holland
17. Sasaki, G.H.; Hajek, B.: The Time Complexity of Maximum Matching by Simulated Annealing, Journal of the Association for Computing Machinery 35, 1988
18. Turner, J.: Almost All k-Colorable Graphs Are Easy to Color, Journal of Algorithms 9, 1988