Author:
Mertzios George B.,Spirakis Paul G.
Publisher
Springer Berlin Heidelberg
Reference23 articles.
1. Alon, N.: Transversal numbers of uniform hypergraphs. Graphs and Combinatorics 6, 1–4 (1990)
2. Alon, N., Spencer, J.H.: The Probabilistic Method, 3rd edn. John Wiley & Sons (2008)
3. Babai, L., Luks, E.M.: Canonical labeling of graphs. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing (STOC), pp. 171–183 (1983)
4. Beigel, R., Eppstein, D.: 3-coloring in time O(1.3289
n
). Journal of Algorithms 54(2), 168–204 (2005)
5. Bodirsky, M., Kára, J., Martin, B.: The complexity of surjective homomorphism problems – A survey. CoRR (2011),
http://arxiv.org/abs/1104.5257
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献