Author:
Kratochvíl Jan,Telle Jan Arne,Tesař Marek
Publisher
Springer Berlin Heidelberg
Reference20 articles.
1. Abello, J., Fellows, M.R., Stillwell, J.C.: On the complexity and combinatorics of covering finite complexes. Australian Journal of Combinatorics 4, 103–112 (1991)
2. Angluin, D.: Local and global properties in networks of processors. In: Proceedings of the 12th ACM Symposium on Theory of Computing, pp. 82–93 (1980)
3. Angluin, D., Gardiner, A.: Finite common coverings of pairs of regular graphs. Journal of Combinatorial Theory, Series B 30(2), 184–187 (1981)
4. Bodlaender, H.L.: The Classification of Coverings of Processor Networks. Journal of Parallel and Distributed Computing 6, 166–182 (1989)
5. Bulatov, A.A.: A dichotomy theorem for constraint satisfaction problems on a 3-element set. J. ACM 53(1), 66–120 (2006)