Lars Engebretsen and Jonas Holmerin. Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci., 299(1-3):537--584, 2003. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Inapproximability Results for Equations over Finite Groups - Engebretsen, Holmerin.. (2002) (2 citations) Self-citation (Engebretsen Holmerin) (Correct)
No context found.
L. Engebretsen, J. Holmerin, Towards optimal lower bounds for clique and chromatic number, Theoretical Computer Science, to appear.
Quorum Placement in Networks: Minimizing Network.. - Golovin, Gupta, Maggs.. (2006) (Correct)
No context found.
Lars Engebretsen and Jonas Holmerin. Towards optimal lower bounds for clique and chromatic number. Theor. Comput. Sci., 299(1-3):537--584, 2003.
On the Approximation of Computing of - Evolutionary Trees Research (Correct)
No context found.
L. Engebretsen and J. Holmerin. Towards optimal lower bounds for clique and chromatic number. Theoretical Computer Science, 299(1--3):537--584, 2003.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC