Author:
Baker Brenda S,Coffman Edward G
Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. A spectral technique for coloring random 3-colorable graphs;Alon,1994
2. Every planar map is four colourable, part i: discharging;Appel;Illinois J. Math.,1977
3. Approximation algorithms for np-complete problems on planar graphs;Baker;J. ACM,1994
4. A better performance guarantee for approximate graph coloring;Berger;Algorithmica,1990
5. parallel domain decomposition applied to coupled transport equations;Bjørstad,1995
Cited by
86 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献