Author:
Coja-Oghlan Amin,Taraz Anusch
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Achlioptas, D., Molloy, M.: The analysis of a list-coloring algorithm on a random graph, Proc. 38th. IEEE Symp. Found. of Comp. Sci. (1997) 204–212
2. Beck, L.L., Matula, D.W.: Smallest-last ordering and clustering and graph coloring algorithms, J. ACM 30 (1983) 417–427
3. Beigel, R., Eppstein, D.: 3-coloring in time O(1.3446 n ): a no-MIS algorithm, Proc. 36th. IEEE Symp. Found. of Comp. Sci. (1995) 444–453
4. Bollobás, B.: Random graphs, 2nd edition, Cambridge University Press 2001
5. Coja-Oghlan, A.: Finding sparse induced subgraphs of semirandom graphs. Proc. 6th. Int. Workshop Randomization and Approximation Techniques in Comp. Sci. (2002) 139–148
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献