Author:
Diks Krzystof,Djidjev Hristo N.,Sykora Ondrej,Vrto Imrich
Reference30 articles.
1. F. Berman, L. Snyder, On mapping parallel algorithms into parallel architectures, J. of Parallel and Distributed Computing, Vol.4, 1987, pp. 439–458.
2. H.N. Djidjev, On the problem of partitioning planar graphs, SIAM J. Alg. Disc. Meth., Vol. 3, No. 2, 1982, pp.229–240.
3. H.N. Djidjev, A Linear algorithm for partitioning graphs of fixed genus, SERDICA, Vol. 11, 1985, 369–387.
4. H.N. Djidjev, A separator theorem for graphs of fixed genus, SERDICA, Vol. 11, 1985, pp. 319–329.
5. R.A. De Millo, S.C. Eisenstat, R.J.L. Lipton, Preserving average proximity in arrays, Comm. ACM, 21, 1978, pp. 228–230.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献